./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_label42+token_ring.02.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 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:37:40,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:37:40,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:37:40,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:37:40,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:37:40,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:37:40,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:37:40,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:37:40,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:37:40,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:37:40,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:37:40,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:37:40,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:37:40,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:37:40,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:37:40,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:37:40,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:37:40,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:37:40,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:37:40,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:37:40,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:37:40,626 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 -> 6e28c81ffc5a1b93c1edca1581014bee1ba1c062c6df3b7a8a783721ae21bc12 [2025-03-03 15:37:40,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:37:40,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:37:40,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:37:40,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:37:40,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:37:40,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2025-03-03 15:37:42,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba512ae9/4f0895f5041046288bb3431e8207a8a6/FLAG27fa3389a [2025-03-03 15:37:42,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:37:42,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.02.cil-1.c [2025-03-03 15:37:42,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba512ae9/4f0895f5041046288bb3431e8207a8a6/FLAG27fa3389a [2025-03-03 15:37:43,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba512ae9/4f0895f5041046288bb3431e8207a8a6 [2025-03-03 15:37:43,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:37:43,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:37:43,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:37:43,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:37:43,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:37:43,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:37:43" (1/1) ... [2025-03-03 15:37:43,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35791167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:43, skipping insertion in model container [2025-03-03 15:37:43,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:37:43" (1/1) ... [2025-03-03 15:37:43,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:37:44,354 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_label42+token_ring.02.cil-1.c[378560,378573] [2025-03-03 15:37:44,388 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_label42+token_ring.02.cil-1.c[383339,383352] [2025-03-03 15:37:44,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:37:44,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:37:45,046 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_label42+token_ring.02.cil-1.c[378560,378573] [2025-03-03 15:37:45,059 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_label42+token_ring.02.cil-1.c[383339,383352] [2025-03-03 15:37:45,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:37:45,166 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:37:45,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45 WrapperNode [2025-03-03 15:37:45,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:37:45,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:37:45,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:37:45,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:37:45,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,523 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12615 [2025-03-03 15:37:45,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:37:45,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:37:45,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:37:45,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:37:45,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,747 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-03 15:37:45,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:45,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:46,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:37:46,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:37:46,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:37:46,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:37:46,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (1/1) ... [2025-03-03 15:37:46,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:37:46,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:46,040 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-03 15:37:46,042 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-03 15:37:46,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:37:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:37:46,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:37:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:37:46,060 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:37:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:37:46,060 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:37:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:37:46,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:37:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:37:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:37:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:37:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:37:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:37:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:37:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:37:46,138 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:37:46,140 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:37:52,351 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:37:52,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:37:52,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:37:52,352 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:37:52,353 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:37:52,353 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:37:52,353 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:37:52,578 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2025-03-03 15:37:52,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:37:52,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:37:52,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:37:52,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:37:52 BoogieIcfgContainer [2025-03-03 15:37:52,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:37:52,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:37:52,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:37:52,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:37:52,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:37:43" (1/3) ... [2025-03-03 15:37:52,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a3f7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:37:52, skipping insertion in model container [2025-03-03 15:37:52,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:37:45" (2/3) ... [2025-03-03 15:37:52,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a3f7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:37:52, skipping insertion in model container [2025-03-03 15:37:52,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:37:52" (3/3) ... [2025-03-03 15:37:52,650 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.02.cil-1.c [2025-03-03 15:37:52,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:37:52,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.02.cil-1.c that has 7 procedures, 2321 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-03-03 15:37:52,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:37:52,770 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;@5a6136fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:37:52,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:37:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 2321 states, 2296 states have (on average 1.8523519163763067) internal successors, (4253), 2299 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 15:37:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:52,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:52,792 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] [2025-03-03 15:37:52,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:52,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1137518292, now seen corresponding path program 1 times [2025-03-03 15:37:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515909991] [2025-03-03 15:37:52,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:52,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:53,127 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-03 15:37:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515909991] [2025-03-03 15:37:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515909991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:53,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:37:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002101847] [2025-03-03 15:37:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:53,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:53,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:37:53,154 INFO L87 Difference]: Start difference. First operand has 2321 states, 2296 states have (on average 1.8523519163763067) internal successors, (4253), 2299 states have internal predecessors, (4253), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:53,678 INFO L93 Difference]: Finished difference Result 4636 states and 8565 transitions. [2025-03-03 15:37:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:37:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:53,700 INFO L225 Difference]: With dead ends: 4636 [2025-03-03 15:37:53,701 INFO L226 Difference]: Without dead ends: 2260 [2025-03-03 15:37:53,709 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-03 15:37:53,714 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4254 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4264 SdHoareTripleChecker+Valid, 12431 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:53,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4264 Valid, 12431 Invalid, 187 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-03-03 15:37:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2254. [2025-03-03 15:37:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2230 states have (on average 1.8457399103139014) internal successors, (4116), 2232 states have internal predecessors, (4116), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 15:37:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 4148 transitions. [2025-03-03 15:37:53,814 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 4148 transitions. Word has length 68 [2025-03-03 15:37:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 4148 transitions. [2025-03-03 15:37:53,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 4148 transitions. [2025-03-03 15:37:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:53,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:53,817 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] [2025-03-03 15:37:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:37:53,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -699508789, now seen corresponding path program 1 times [2025-03-03 15:37:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643815796] [2025-03-03 15:37:53,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:53,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:53,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:53,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:53,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:53,971 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-03 15:37:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643815796] [2025-03-03 15:37:53,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643815796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:53,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:37:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843996732] [2025-03-03 15:37:53,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:37:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:53,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:37:53,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:53,974 INFO L87 Difference]: Start difference. First operand 2254 states and 4148 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:54,331 INFO L93 Difference]: Finished difference Result 2514 states and 4530 transitions. [2025-03-03 15:37:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:37:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:37:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:54,343 INFO L225 Difference]: With dead ends: 2514 [2025-03-03 15:37:54,343 INFO L226 Difference]: Without dead ends: 2391 [2025-03-03 15:37:54,345 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-03 15:37:54,345 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4247 mSDsluCounter, 12585 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4257 SdHoareTripleChecker+Valid, 16781 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:54,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4257 Valid, 16781 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-03-03 15:37:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2379. [2025-03-03 15:37:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2334 states have (on average 1.8281919451585262) internal successors, (4267), 2338 states have internal predecessors, (4267), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (36), 30 states have call predecessors, (36), 29 states have call successors, (36) [2025-03-03 15:37:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4332 transitions. [2025-03-03 15:37:54,398 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4332 transitions. Word has length 68 [2025-03-03 15:37:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:54,398 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 4332 transitions. [2025-03-03 15:37:54,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4332 transitions. [2025-03-03 15:37:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:54,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:54,400 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] [2025-03-03 15:37:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:37:54,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:54,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1669925196, now seen corresponding path program 1 times [2025-03-03 15:37:54,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:54,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443828308] [2025-03-03 15:37:54,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:54,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:54,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:54,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:54,543 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-03 15:37:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443828308] [2025-03-03 15:37:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443828308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:37:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516601017] [2025-03-03 15:37:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:54,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:37:54,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:54,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:37:54,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:54,545 INFO L87 Difference]: Start difference. First operand 2379 states and 4332 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:54,907 INFO L93 Difference]: Finished difference Result 2913 states and 5112 transitions. [2025-03-03 15:37:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:37:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:37:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:54,916 INFO L225 Difference]: With dead ends: 2913 [2025-03-03 15:37:54,917 INFO L226 Difference]: Without dead ends: 2667 [2025-03-03 15:37:54,918 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-03 15:37:54,918 INFO L435 NwaCegarLoop]: 4172 mSDtfsCounter, 4318 mSDsluCounter, 12521 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4331 SdHoareTripleChecker+Valid, 16693 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:54,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4331 Valid, 16693 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:37:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-03 15:37:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2609. [2025-03-03 15:37:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2528 states have (on average 1.798259493670886) internal successors, (4546), 2536 states have internal predecessors, (4546), 49 states have call successors, (49), 24 states have call predecessors, (49), 30 states have return successors, (72), 52 states have call predecessors, (72), 49 states have call successors, (72) [2025-03-03 15:37:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4667 transitions. [2025-03-03 15:37:54,982 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4667 transitions. Word has length 68 [2025-03-03 15:37:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4667 transitions. [2025-03-03 15:37:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4667 transitions. [2025-03-03 15:37:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:54,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:54,985 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] [2025-03-03 15:37:54,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:37:54,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:54,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1855872085, now seen corresponding path program 1 times [2025-03-03 15:37:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397744514] [2025-03-03 15:37:54,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:54,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:54,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:55,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:55,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:55,055 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-03 15:37:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397744514] [2025-03-03 15:37:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397744514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:37:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201265527] [2025-03-03 15:37:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:37:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:55,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:37:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:37:55,057 INFO L87 Difference]: Start difference. First operand 2609 states and 4667 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:55,276 INFO L93 Difference]: Finished difference Result 3114 states and 5421 transitions. [2025-03-03 15:37:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:37:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:55,289 INFO L225 Difference]: With dead ends: 3114 [2025-03-03 15:37:55,289 INFO L226 Difference]: Without dead ends: 2636 [2025-03-03 15:37:55,291 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-03 15:37:55,292 INFO L435 NwaCegarLoop]: 4088 mSDtfsCounter, 4180 mSDsluCounter, 8120 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 12208 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:55,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 12208 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-03 15:37:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2609. [2025-03-03 15:37:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2528 states have (on average 1.7962816455696202) internal successors, (4541), 2536 states have internal predecessors, (4541), 49 states have call successors, (49), 24 states have call predecessors, (49), 30 states have return successors, (72), 52 states have call predecessors, (72), 49 states have call successors, (72) [2025-03-03 15:37:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4662 transitions. [2025-03-03 15:37:55,367 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4662 transitions. Word has length 68 [2025-03-03 15:37:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:55,367 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4662 transitions. [2025-03-03 15:37:55,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4662 transitions. [2025-03-03 15:37:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:55,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:55,369 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] [2025-03-03 15:37:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:37:55,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -722681492, now seen corresponding path program 1 times [2025-03-03 15:37:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113654497] [2025-03-03 15:37:55,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:55,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:55,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:55,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:55,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:55,463 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-03 15:37:55,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113654497] [2025-03-03 15:37:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113654497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:55,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:55,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:37:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526505726] [2025-03-03 15:37:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:55,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:37:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:55,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:37:55,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:55,465 INFO L87 Difference]: Start difference. First operand 2609 states and 4662 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:55,795 INFO L93 Difference]: Finished difference Result 3589 states and 6089 transitions. [2025-03-03 15:37:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:37:55,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-03 15:37:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:55,809 INFO L225 Difference]: With dead ends: 3589 [2025-03-03 15:37:55,810 INFO L226 Difference]: Without dead ends: 3113 [2025-03-03 15:37:55,812 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-03 15:37:55,814 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4245 mSDsluCounter, 12484 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4258 SdHoareTripleChecker+Valid, 16646 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:55,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4258 Valid, 16646 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:37:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2025-03-03 15:37:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3069. [2025-03-03 15:37:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2912 states have (on average 1.7455357142857142) internal successors, (5083), 2934 states have internal predecessors, (5083), 87 states have call successors, (87), 48 states have call predecessors, (87), 68 states have return successors, (166), 94 states have call predecessors, (166), 87 states have call successors, (166) [2025-03-03 15:37:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 5336 transitions. [2025-03-03 15:37:55,894 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 5336 transitions. Word has length 68 [2025-03-03 15:37:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:55,894 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 5336 transitions. [2025-03-03 15:37:55,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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-03 15:37:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 5336 transitions. [2025-03-03 15:37:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:37:55,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:55,896 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] [2025-03-03 15:37:55,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:37:55,896 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:55,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash -963221621, now seen corresponding path program 1 times [2025-03-03 15:37:55,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:55,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602207462] [2025-03-03 15:37:55,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:55,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:55,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:37:55,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:37:55,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:55,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:55,936 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-03 15:37:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:55,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602207462] [2025-03-03 15:37:55,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602207462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:55,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:37:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:37:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882120520] [2025-03-03 15:37:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:37:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:55,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:37:55,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:37:55,939 INFO L87 Difference]: Start difference. First operand 3069 states and 5336 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 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-03 15:37:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:56,144 INFO L93 Difference]: Finished difference Result 4897 states and 8037 transitions. [2025-03-03 15:37:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:37:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 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 68 [2025-03-03 15:37:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:56,159 INFO L225 Difference]: With dead ends: 4897 [2025-03-03 15:37:56,159 INFO L226 Difference]: Without dead ends: 3961 [2025-03-03 15:37:56,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:37:56,164 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4272 mSDsluCounter, 4239 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 8537 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:56,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 8537 Invalid, 76 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:37:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2025-03-03 15:37:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3953. [2025-03-03 15:37:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3953 states, 3647 states have (on average 1.6682204551686317) internal successors, (6084), 3697 states have internal predecessors, (6084), 168 states have call successors, (168), 96 states have call predecessors, (168), 136 states have return successors, (311), 167 states have call predecessors, (311), 168 states have call successors, (311) [2025-03-03 15:37:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 6563 transitions. [2025-03-03 15:37:56,299 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 6563 transitions. Word has length 68 [2025-03-03 15:37:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 3953 states and 6563 transitions. [2025-03-03 15:37:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 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-03 15:37:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 6563 transitions. [2025-03-03 15:37:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:37:56,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:56,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:56,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:37:56,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:56,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1365497866, now seen corresponding path program 1 times [2025-03-03 15:37:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:56,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467789640] [2025-03-03 15:37:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:56,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:37:56,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:56,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467789640] [2025-03-03 15:37:56,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467789640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:56,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953488509] [2025-03-03 15:37:56,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:56,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:56,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:56,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:56,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:37:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:56,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:56,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:56,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:56,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:56,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:37:56,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953488509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:37:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763830950] [2025-03-03 15:37:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:56,544 INFO L87 Difference]: Start difference. First operand 3953 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:56,669 INFO L93 Difference]: Finished difference Result 7535 states and 11695 transitions. [2025-03-03 15:37:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 15:37:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:56,689 INFO L225 Difference]: With dead ends: 7535 [2025-03-03 15:37:56,690 INFO L226 Difference]: Without dead ends: 5715 [2025-03-03 15:37:56,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:56,740 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4101 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4101 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4101 Valid, 4304 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2025-03-03 15:37:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 5665. [2025-03-03 15:37:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5069 states have (on average 1.5888735450779246) internal successors, (8054), 5167 states have internal predecessors, (8054), 322 states have call successors, (322), 192 states have call predecessors, (322), 272 states have return successors, (593), 313 states have call predecessors, (593), 322 states have call successors, (593) [2025-03-03 15:37:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 8969 transitions. [2025-03-03 15:37:57,086 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 8969 transitions. Word has length 112 [2025-03-03 15:37:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:57,087 INFO L471 AbstractCegarLoop]: Abstraction has 5665 states and 8969 transitions. [2025-03-03 15:37:57,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 8969 transitions. [2025-03-03 15:37:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:37:57,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:57,097 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:57,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:37:57,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:57,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:57,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash 363975056, now seen corresponding path program 1 times [2025-03-03 15:37:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001379523] [2025-03-03 15:37:57,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:57,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:37:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001379523] [2025-03-03 15:37:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001379523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025087289] [2025-03-03 15:37:57,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:57,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:57,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:57,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:37:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:57,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:57,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:57,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:37:57,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025087289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:37:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629800919] [2025-03-03 15:37:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:57,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:57,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:57,494 INFO L87 Difference]: Start difference. First operand 5665 states and 8969 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:57,752 INFO L93 Difference]: Finished difference Result 12615 states and 18883 transitions. [2025-03-03 15:37:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-03-03 15:37:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:57,788 INFO L225 Difference]: With dead ends: 12615 [2025-03-03 15:37:57,788 INFO L226 Difference]: Without dead ends: 9083 [2025-03-03 15:37:57,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:57,800 INFO L435 NwaCegarLoop]: 4142 mSDtfsCounter, 4107 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:57,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 4304 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2025-03-03 15:37:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 8985. [2025-03-03 15:37:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8985 states, 7817 states have (on average 1.5159268261481387) internal successors, (11850), 8011 states have internal predecessors, (11850), 622 states have call successors, (622), 384 states have call predecessors, (622), 544 states have return successors, (1149), 597 states have call predecessors, (1149), 622 states have call successors, (1149) [2025-03-03 15:37:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 13621 transitions. [2025-03-03 15:37:58,208 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 13621 transitions. Word has length 112 [2025-03-03 15:37:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:37:58,208 INFO L471 AbstractCegarLoop]: Abstraction has 8985 states and 13621 transitions. [2025-03-03 15:37:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:37:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 13621 transitions. [2025-03-03 15:37:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:37:58,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:37:58,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:37:58,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:37:58,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 15:37:58,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:37:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:37:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1281625750, now seen corresponding path program 1 times [2025-03-03 15:37:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:37:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959871705] [2025-03-03 15:37:58,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:37:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:37:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:37:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959871705] [2025-03-03 15:37:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959871705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:37:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528289450] [2025-03-03 15:37:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:37:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:37:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:37:58,484 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:37:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:37:58,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:37:58,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:37:58,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:37:58,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:37:58,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:37:58,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:37:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:37:58,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:37:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528289450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:37:58,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:37:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:37:58,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356573508] [2025-03-03 15:37:58,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:37:58,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:37:58,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:37:58,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:37:58,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:58,592 INFO L87 Difference]: Start difference. First operand 8985 states and 13621 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:37:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:37:59,349 INFO L93 Difference]: Finished difference Result 22071 states and 32446 transitions. [2025-03-03 15:37:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:37:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-03-03 15:37:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:37:59,399 INFO L225 Difference]: With dead ends: 22071 [2025-03-03 15:37:59,399 INFO L226 Difference]: Without dead ends: 15221 [2025-03-03 15:37:59,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:37:59,417 INFO L435 NwaCegarLoop]: 4301 mSDtfsCounter, 156 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8440 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:37:59,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8440 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:37:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15221 states. [2025-03-03 15:37:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15221 to 15221. [2025-03-03 15:37:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15221 states, 13024 states have (on average 1.4609183046683047) internal successors, (19027), 13379 states have internal predecessors, (19027), 1143 states have call successors, (1143), 732 states have call predecessors, (1143), 1052 states have return successors, (2331), 1125 states have call predecessors, (2331), 1143 states have call successors, (2331) [2025-03-03 15:38:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15221 states to 15221 states and 22501 transitions. [2025-03-03 15:38:00,093 INFO L78 Accepts]: Start accepts. Automaton has 15221 states and 22501 transitions. Word has length 112 [2025-03-03 15:38:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:00,094 INFO L471 AbstractCegarLoop]: Abstraction has 15221 states and 22501 transitions. [2025-03-03 15:38:00,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:38:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15221 states and 22501 transitions. [2025-03-03 15:38:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:38:00,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:00,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:00,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:00,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2110809421, now seen corresponding path program 1 times [2025-03-03 15:38:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020610144] [2025-03-03 15:38:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:00,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:00,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:38:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020610144] [2025-03-03 15:38:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020610144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024905008] [2025-03-03 15:38:00,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:00,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:00,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:38:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:00,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:00,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:00,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:00,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:38:00,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:38:00,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024905008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677136430] [2025-03-03 15:38:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:00,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:00,635 INFO L87 Difference]: Start difference. First operand 15221 states and 22501 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:38:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:00,992 INFO L93 Difference]: Finished difference Result 23477 states and 34580 transitions. [2025-03-03 15:38:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 15:38:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:01,046 INFO L225 Difference]: With dead ends: 23477 [2025-03-03 15:38:01,046 INFO L226 Difference]: Without dead ends: 13375 [2025-03-03 15:38:01,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:01,073 INFO L435 NwaCegarLoop]: 4139 mSDtfsCounter, 4074 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 4173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:01,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 4173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13375 states. [2025-03-03 15:38:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13375 to 13303. [2025-03-03 15:38:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13303 states, 11534 states have (on average 1.4374024622854171) internal successors, (16579), 11715 states have internal predecessors, (16579), 965 states have call successors, (965), 650 states have call predecessors, (965), 802 states have return successors, (1595), 947 states have call predecessors, (1595), 965 states have call successors, (1595) [2025-03-03 15:38:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13303 states to 13303 states and 19139 transitions. [2025-03-03 15:38:02,039 INFO L78 Accepts]: Start accepts. Automaton has 13303 states and 19139 transitions. Word has length 164 [2025-03-03 15:38:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:02,039 INFO L471 AbstractCegarLoop]: Abstraction has 13303 states and 19139 transitions. [2025-03-03 15:38:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:38:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13303 states and 19139 transitions. [2025-03-03 15:38:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:38:02,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:02,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:02,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:02,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:02,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:02,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 308746920, now seen corresponding path program 1 times [2025-03-03 15:38:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132684076] [2025-03-03 15:38:02,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:02,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:02,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:02,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:38:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132684076] [2025-03-03 15:38:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132684076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629307881] [2025-03-03 15:38:02,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:02,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:02,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:38:02,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:02,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:02,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:02,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:38:02,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:38:02,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629307881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347297416] [2025-03-03 15:38:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:02,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:02,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:02,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:02,532 INFO L87 Difference]: Start difference. First operand 13303 states and 19139 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:38:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:03,050 INFO L93 Difference]: Finished difference Result 21651 states and 30916 transitions. [2025-03-03 15:38:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-03-03 15:38:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:03,085 INFO L225 Difference]: With dead ends: 21651 [2025-03-03 15:38:03,085 INFO L226 Difference]: Without dead ends: 11919 [2025-03-03 15:38:03,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:03,104 INFO L435 NwaCegarLoop]: 4138 mSDtfsCounter, 4089 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:03,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11919 states. [2025-03-03 15:38:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11919 to 11899. [2025-03-03 15:38:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11899 states, 10444 states have (on average 1.4201455381080046) internal successors, (14832), 10536 states have internal predecessors, (14832), 811 states have call successors, (811), 574 states have call predecessors, (811), 642 states have return successors, (1167), 794 states have call predecessors, (1167), 811 states have call successors, (1167) [2025-03-03 15:38:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11899 states to 11899 states and 16810 transitions. [2025-03-03 15:38:03,540 INFO L78 Accepts]: Start accepts. Automaton has 11899 states and 16810 transitions. Word has length 164 [2025-03-03 15:38:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:03,540 INFO L471 AbstractCegarLoop]: Abstraction has 11899 states and 16810 transitions. [2025-03-03 15:38:03,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:38:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 11899 states and 16810 transitions. [2025-03-03 15:38:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:38:03,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:03,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:03,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 15:38:03,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -276938393, now seen corresponding path program 1 times [2025-03-03 15:38:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490784730] [2025-03-03 15:38:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:03,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:03,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:03,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:03,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:38:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490784730] [2025-03-03 15:38:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490784730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258852246] [2025-03-03 15:38:03,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:03,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:03,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:03,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:03,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:38:03,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:38:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:38:03,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:03,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:03,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:38:03,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 15:38:03,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258852246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:03,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737638433] [2025-03-03 15:38:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:03,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:03,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:03,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:03,958 INFO L87 Difference]: Start difference. First operand 11899 states and 16810 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:04,326 INFO L93 Difference]: Finished difference Result 20294 states and 27761 transitions. [2025-03-03 15:38:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 164 [2025-03-03 15:38:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:04,367 INFO L225 Difference]: With dead ends: 20294 [2025-03-03 15:38:04,367 INFO L226 Difference]: Without dead ends: 12833 [2025-03-03 15:38:04,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:04,379 INFO L435 NwaCegarLoop]: 4185 mSDtfsCounter, 4084 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:04,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12833 states. [2025-03-03 15:38:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12833 to 12728. [2025-03-03 15:38:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12728 states, 11231 states have (on average 1.3939097141839552) internal successors, (15655), 11323 states have internal predecessors, (15655), 811 states have call successors, (811), 616 states have call predecessors, (811), 684 states have return successors, (1209), 794 states have call predecessors, (1209), 811 states have call successors, (1209) [2025-03-03 15:38:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12728 states to 12728 states and 17675 transitions. [2025-03-03 15:38:04,983 INFO L78 Accepts]: Start accepts. Automaton has 12728 states and 17675 transitions. Word has length 164 [2025-03-03 15:38:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:04,984 INFO L471 AbstractCegarLoop]: Abstraction has 12728 states and 17675 transitions. [2025-03-03 15:38:04,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12728 states and 17675 transitions. [2025-03-03 15:38:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 15:38:05,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:05,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:05,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:05,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:05,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:05,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -688111560, now seen corresponding path program 1 times [2025-03-03 15:38:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244789882] [2025-03-03 15:38:05,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:05,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:05,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:38:05,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:38:05,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:05,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 15:38:05,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244789882] [2025-03-03 15:38:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244789882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744076078] [2025-03-03 15:38:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:05,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:05,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:05,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:38:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:38:05,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:38:05,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:05,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:05,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:38:05,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 15:38:05,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744076078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846086466] [2025-03-03 15:38:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:05,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:05,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:05,437 INFO L87 Difference]: Start difference. First operand 12728 states and 17675 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:05,994 INFO L93 Difference]: Finished difference Result 32632 states and 43853 transitions. [2025-03-03 15:38:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2025-03-03 15:38:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:06,065 INFO L225 Difference]: With dead ends: 32632 [2025-03-03 15:38:06,065 INFO L226 Difference]: Without dead ends: 22047 [2025-03-03 15:38:06,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:06,088 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 139 mSDsluCounter, 4133 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8425 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22047 states. [2025-03-03 15:38:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22047 to 22045. [2025-03-03 15:38:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22045 states, 19166 states have (on average 1.3391944067619743) internal successors, (25667), 19349 states have internal predecessors, (25667), 1565 states have call successors, (1565), 1176 states have call predecessors, (1565), 1312 states have return successors, (2699), 1531 states have call predecessors, (2699), 1565 states have call successors, (2699) [2025-03-03 15:38:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22045 states to 22045 states and 29931 transitions. [2025-03-03 15:38:07,163 INFO L78 Accepts]: Start accepts. Automaton has 22045 states and 29931 transitions. Word has length 165 [2025-03-03 15:38:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 22045 states and 29931 transitions. [2025-03-03 15:38:07,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22045 states and 29931 transitions. [2025-03-03 15:38:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:38:07,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:07,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:07,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:38:07,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:07,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:07,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:07,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1375426545, now seen corresponding path program 1 times [2025-03-03 15:38:07,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:07,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106318584] [2025-03-03 15:38:07,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:07,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:07,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 15:38:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106318584] [2025-03-03 15:38:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106318584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101626449] [2025-03-03 15:38:07,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:07,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:07,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:07,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:07,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:38:07,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:07,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:07,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:07,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:07,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:38:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 15:38:07,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:07,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101626449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:07,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657927921] [2025-03-03 15:38:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:07,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:07,650 INFO L87 Difference]: Start difference. First operand 22045 states and 29931 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:08,437 INFO L93 Difference]: Finished difference Result 43215 states and 58408 transitions. [2025-03-03 15:38:08,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 15:38:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:08,554 INFO L225 Difference]: With dead ends: 43215 [2025-03-03 15:38:08,555 INFO L226 Difference]: Without dead ends: 23325 [2025-03-03 15:38:08,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:08,607 INFO L435 NwaCegarLoop]: 4141 mSDtfsCounter, 4096 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 4173 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:08,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 4173 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23325 states. [2025-03-03 15:38:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23325 to 22045. [2025-03-03 15:38:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22045 states, 19166 states have (on average 1.3141500573933007) internal successors, (25187), 19349 states have internal predecessors, (25187), 1565 states have call successors, (1565), 1176 states have call predecessors, (1565), 1312 states have return successors, (2573), 1531 states have call predecessors, (2573), 1565 states have call successors, (2573) [2025-03-03 15:38:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22045 states to 22045 states and 29325 transitions. [2025-03-03 15:38:09,454 INFO L78 Accepts]: Start accepts. Automaton has 22045 states and 29325 transitions. Word has length 166 [2025-03-03 15:38:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:09,454 INFO L471 AbstractCegarLoop]: Abstraction has 22045 states and 29325 transitions. [2025-03-03 15:38:09,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22045 states and 29325 transitions. [2025-03-03 15:38:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:38:09,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:09,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:09,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:09,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 15:38:09,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:09,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash -766321137, now seen corresponding path program 1 times [2025-03-03 15:38:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586734069] [2025-03-03 15:38:09,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:09,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:09,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 15:38:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586734069] [2025-03-03 15:38:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586734069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933856343] [2025-03-03 15:38:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:09,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:09,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:09,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:38:09,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:09,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:09,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:09,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:09,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:38:09,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:38:09,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933856343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779909795] [2025-03-03 15:38:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:09,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:09,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:09,820 INFO L87 Difference]: Start difference. First operand 22045 states and 29325 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:10,829 INFO L93 Difference]: Finished difference Result 59295 states and 77593 transitions. [2025-03-03 15:38:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-03-03 15:38:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:10,974 INFO L225 Difference]: With dead ends: 59295 [2025-03-03 15:38:10,974 INFO L226 Difference]: Without dead ends: 39405 [2025-03-03 15:38:11,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:11,021 INFO L435 NwaCegarLoop]: 4290 mSDtfsCounter, 146 mSDsluCounter, 4131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:11,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 8421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39405 states. [2025-03-03 15:38:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39405 to 39403. [2025-03-03 15:38:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39403 states, 33872 states have (on average 1.2722307510628248) internal successors, (43093), 34237 states have internal predecessors, (43093), 3017 states have call successors, (3017), 2240 states have call predecessors, (3017), 2512 states have return successors, (5697), 2949 states have call predecessors, (5697), 3017 states have call successors, (5697) [2025-03-03 15:38:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39403 states to 39403 states and 51807 transitions. [2025-03-03 15:38:13,353 INFO L78 Accepts]: Start accepts. Automaton has 39403 states and 51807 transitions. Word has length 166 [2025-03-03 15:38:13,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:13,354 INFO L471 AbstractCegarLoop]: Abstraction has 39403 states and 51807 transitions. [2025-03-03 15:38:13,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:38:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 39403 states and 51807 transitions. [2025-03-03 15:38:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:38:13,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:13,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:13,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 15:38:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 15:38:13,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1262156672, now seen corresponding path program 1 times [2025-03-03 15:38:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030609499] [2025-03-03 15:38:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 15:38:13,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030609499] [2025-03-03 15:38:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030609499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106955579] [2025-03-03 15:38:13,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:13,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:13,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:13,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:38:13,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:13,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:13,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:13,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:13,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:38:13,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 15:38:13,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106955579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752534275] [2025-03-03 15:38:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:13,763 INFO L87 Difference]: Start difference. First operand 39403 states and 51807 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:15,095 INFO L93 Difference]: Finished difference Result 70693 states and 92129 transitions. [2025-03-03 15:38:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-03-03 15:38:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:15,239 INFO L225 Difference]: With dead ends: 70693 [2025-03-03 15:38:15,239 INFO L226 Difference]: Without dead ends: 40081 [2025-03-03 15:38:15,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:15,296 INFO L435 NwaCegarLoop]: 4161 mSDtfsCounter, 4092 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:15,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4323 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40081 states. [2025-03-03 15:38:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40081 to 39319. [2025-03-03 15:38:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39319 states, 33788 states have (on average 1.2642062270628625) internal successors, (42715), 34153 states have internal predecessors, (42715), 3017 states have call successors, (3017), 2240 states have call predecessors, (3017), 2512 states have return successors, (5697), 2949 states have call predecessors, (5697), 3017 states have call successors, (5697) [2025-03-03 15:38:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39319 states to 39319 states and 51429 transitions. [2025-03-03 15:38:17,377 INFO L78 Accepts]: Start accepts. Automaton has 39319 states and 51429 transitions. Word has length 166 [2025-03-03 15:38:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:17,377 INFO L471 AbstractCegarLoop]: Abstraction has 39319 states and 51429 transitions. [2025-03-03 15:38:17,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 39319 states and 51429 transitions. [2025-03-03 15:38:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:38:17,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:17,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:17,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 15:38:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:38:17,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:17,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash -558376095, now seen corresponding path program 1 times [2025-03-03 15:38:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872287391] [2025-03-03 15:38:17,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:17,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:38:17,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:38:17,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:17,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 15:38:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872287391] [2025-03-03 15:38:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872287391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:17,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:38:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:38:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645168506] [2025-03-03 15:38:17,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:17,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:17,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:17,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:38:17,652 INFO L87 Difference]: Start difference. First operand 39319 states and 51429 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:38:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:19,440 INFO L93 Difference]: Finished difference Result 69855 states and 90254 transitions. [2025-03-03 15:38:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 166 [2025-03-03 15:38:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:19,563 INFO L225 Difference]: With dead ends: 69855 [2025-03-03 15:38:19,563 INFO L226 Difference]: Without dead ends: 32683 [2025-03-03 15:38:19,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:38:19,614 INFO L435 NwaCegarLoop]: 4136 mSDtfsCounter, 173 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 8094 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:19,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 8094 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32683 states. [2025-03-03 15:38:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32683 to 32683. [2025-03-03 15:38:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32683 states, 28188 states have (on average 1.2751880232723145) internal successors, (35945), 28477 states have internal predecessors, (35945), 2445 states have call successors, (2445), 1832 states have call predecessors, (2445), 2048 states have return successors, (4449), 2385 states have call predecessors, (4449), 2445 states have call successors, (4449) [2025-03-03 15:38:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32683 states to 32683 states and 42839 transitions. [2025-03-03 15:38:20,975 INFO L78 Accepts]: Start accepts. Automaton has 32683 states and 42839 transitions. Word has length 166 [2025-03-03 15:38:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:20,975 INFO L471 AbstractCegarLoop]: Abstraction has 32683 states and 42839 transitions. [2025-03-03 15:38:20,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 15:38:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32683 states and 42839 transitions. [2025-03-03 15:38:20,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:38:20,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:20,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:20,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:38:20,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1163232919, now seen corresponding path program 1 times [2025-03-03 15:38:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:20,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335447406] [2025-03-03 15:38:20,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:38:21,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:38:21,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:21,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 15:38:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335447406] [2025-03-03 15:38:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335447406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:38:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209410391] [2025-03-03 15:38:21,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:38:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:38:21,058 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:38:21,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 15:38:21,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:38:21,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:38:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:21,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:38:21,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:38:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 15:38:21,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:38:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209410391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:21,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:38:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:38:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414264955] [2025-03-03 15:38:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:21,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:21,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:21,187 INFO L87 Difference]: Start difference. First operand 32683 states and 42839 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:38:22,215 INFO L93 Difference]: Finished difference Result 58072 states and 75157 transitions. [2025-03-03 15:38:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:38:22,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 167 [2025-03-03 15:38:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:38:22,359 INFO L225 Difference]: With dead ends: 58072 [2025-03-03 15:38:22,359 INFO L226 Difference]: Without dead ends: 32993 [2025-03-03 15:38:22,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:38:22,635 INFO L435 NwaCegarLoop]: 4152 mSDtfsCounter, 4090 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:38:22,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 4312 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:38:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32993 states. [2025-03-03 15:38:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32993 to 32683. [2025-03-03 15:38:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32683 states, 28188 states have (on average 1.2694408968355329) internal successors, (35783), 28477 states have internal predecessors, (35783), 2445 states have call successors, (2445), 1832 states have call predecessors, (2445), 2048 states have return successors, (4449), 2385 states have call predecessors, (4449), 2445 states have call successors, (4449) [2025-03-03 15:38:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32683 states to 32683 states and 42677 transitions. [2025-03-03 15:38:24,547 INFO L78 Accepts]: Start accepts. Automaton has 32683 states and 42677 transitions. Word has length 167 [2025-03-03 15:38:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:38:24,548 INFO L471 AbstractCegarLoop]: Abstraction has 32683 states and 42677 transitions. [2025-03-03 15:38:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:38:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 32683 states and 42677 transitions. [2025-03-03 15:38:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 15:38:24,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:38:24,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:38:24,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 15:38:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:38:24,772 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:38:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:38:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -971834967, now seen corresponding path program 1 times [2025-03-03 15:38:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:38:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917933471] [2025-03-03 15:38:24,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:38:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:38:24,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 15:38:24,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 15:38:24,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:38:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:38:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 15:38:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:38:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917933471] [2025-03-03 15:38:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917933471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:38:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:38:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:38:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34716457] [2025-03-03 15:38:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:38:24,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:38:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:38:24,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:38:24,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:38:24,806 INFO L87 Difference]: Start difference. First operand 32683 states and 42677 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)