./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:27:03,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:27:03,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:27:03,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:27:03,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:27:03,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:27:03,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:27:03,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:27:03,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:27:03,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:27:03,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:27:03,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:27:03,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:27:03,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:27:03,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:27:03,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:27:03,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:03,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:03,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:03,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:27:03,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:27:03,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:27:03,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:27:03,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:27:03,515 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd [2025-01-09 05:27:03,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:27:03,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:27:03,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:27:03,824 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:27:03,824 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:27:03,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-01-09 05:27:05,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77aeccb74/a3b788dec68847b8aa123d55b5712b5e/FLAG60f1cfede [2025-01-09 05:27:05,983 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:27:05,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-01-09 05:27:06,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77aeccb74/a3b788dec68847b8aa123d55b5712b5e/FLAG60f1cfede [2025-01-09 05:27:06,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77aeccb74/a3b788dec68847b8aa123d55b5712b5e [2025-01-09 05:27:06,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:27:06,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:27:06,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:06,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:27:06,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:27:06,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:06" (1/1) ... [2025-01-09 05:27:06,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7d619f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:06, skipping insertion in model container [2025-01-09 05:27:06,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:06" (1/1) ... [2025-01-09 05:27:06,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:27:07,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[380593,380606] [2025-01-09 05:27:07,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[383339,383352] [2025-01-09 05:27:08,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:08,186 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:27:08,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[380593,380606] [2025-01-09 05:27:08,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[383339,383352] [2025-01-09 05:27:08,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:09,055 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:27:09,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09 WrapperNode [2025-01-09 05:27:09,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:09,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:09,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:27:09,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:27:09,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,473 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-01-09 05:27:09,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:09,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:27:09,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:27:09,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:27:09,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,737 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-01-09 05:27:09,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:09,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:27:10,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:27:10,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:27:10,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:27:10,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (1/1) ... [2025-01-09 05:27:10,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:10,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:27:10,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:27:10,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:27:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:27:10,445 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:27:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:27:10,445 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:27:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:27:10,445 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:27:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:27:10,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:27:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:27:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:27:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:27:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:27:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:27:10,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:27:10,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:27:10,569 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:27:10,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:27:18,937 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-01-09 05:27:18,938 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:27:19,007 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:27:19,007 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 05:27:19,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:27:19 BoogieIcfgContainer [2025-01-09 05:27:19,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:27:19,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:27:19,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:27:19,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:27:19,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:27:06" (1/3) ... [2025-01-09 05:27:19,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf2978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:27:19, skipping insertion in model container [2025-01-09 05:27:19,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:09" (2/3) ... [2025-01-09 05:27:19,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcf2978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:27:19, skipping insertion in model container [2025-01-09 05:27:19,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:27:19" (3/3) ... [2025-01-09 05:27:19,017 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-2.c [2025-01-09 05:27:19,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:27:19,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.03.cil-2.c that has 7 procedures, 2338 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-01-09 05:27:19,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:27:19,162 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;@77f0e42b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:27:19,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:27:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:27:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:19,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:19,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:19,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash -403788940, now seen corresponding path program 1 times [2025-01-09 05:27:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392237750] [2025-01-09 05:27:19,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:19,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:19,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:19,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392237750] [2025-01-09 05:27:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392237750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:19,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:27:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790816150] [2025-01-09 05:27:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:19,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:19,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:27:19,574 INFO L87 Difference]: Start difference. First operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:19,833 INFO L93 Difference]: Finished difference Result 4671 states and 8629 transitions. [2025-01-09 05:27:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:19,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:27:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:19,867 INFO L225 Difference]: With dead ends: 4671 [2025-01-09 05:27:19,868 INFO L226 Difference]: Without dead ends: 2271 [2025-01-09 05:27:19,878 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-01-09 05:27:19,881 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 223 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 8271 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-01-09 05:27:19,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 8271 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2025-01-09 05:27:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2271. [2025-01-09 05:27:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2246 states have (on average 1.8463935886019591) internal successors, (4147), 2248 states have internal predecessors, (4147), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:27:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 4181 transitions. [2025-01-09 05:27:20,046 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 4181 transitions. Word has length 77 [2025-01-09 05:27:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:20,047 INFO L471 AbstractCegarLoop]: Abstraction has 2271 states and 4181 transitions. [2025-01-09 05:27:20,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:27:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 4181 transitions. [2025-01-09 05:27:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:20,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:20,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:27:20,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash 88837234, now seen corresponding path program 1 times [2025-01-09 05:27:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987369562] [2025-01-09 05:27:20,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:20,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:20,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:20,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:20,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:20,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:20,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:20,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987369562] [2025-01-09 05:27:20,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987369562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:20,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:20,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:27:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279822114] [2025-01-09 05:27:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:20,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:27:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:20,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:27:20,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:27:20,324 INFO L87 Difference]: Start difference. First operand 2271 states and 4181 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-01-09 05:27:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:20,760 INFO L93 Difference]: Finished difference Result 2561 states and 4621 transitions. [2025-01-09 05:27:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:27:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:20,778 INFO L225 Difference]: With dead ends: 2561 [2025-01-09 05:27:20,779 INFO L226 Difference]: Without dead ends: 2422 [2025-01-09 05:27:20,782 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-01-09 05:27:20,784 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4341 mSDsluCounter, 8362 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:20,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12506 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:27:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-01-09 05:27:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2411. [2025-01-09 05:27:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.8301647655259823) internal successors, (4332), 2370 states have internal predecessors, (4332), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-01-09 05:27:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4391 transitions. [2025-01-09 05:27:20,871 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4391 transitions. Word has length 77 [2025-01-09 05:27:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:20,871 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4391 transitions. [2025-01-09 05:27:20,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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-01-09 05:27:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4391 transitions. [2025-01-09 05:27:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:20,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:20,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:20,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:27:20,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:20,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash -188010762, now seen corresponding path program 1 times [2025-01-09 05:27:20,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:20,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877914041] [2025-01-09 05:27:20,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:20,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:20,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:20,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877914041] [2025-01-09 05:27:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877914041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394772727] [2025-01-09 05:27:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:21,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:21,116 INFO L87 Difference]: Start difference. First operand 2411 states and 4391 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:21,664 INFO L93 Difference]: Finished difference Result 2864 states and 5078 transitions. [2025-01-09 05:27:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:21,679 INFO L225 Difference]: With dead ends: 2864 [2025-01-09 05:27:21,680 INFO L226 Difference]: Without dead ends: 2585 [2025-01-09 05:27:21,683 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-01-09 05:27:21,686 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4333 mSDsluCounter, 12684 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16921 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:21,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16921 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:27:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-01-09 05:27:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2542. [2025-01-09 05:27:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2479 states have (on average 1.8148446954417103) internal successors, (4499), 2483 states have internal predecessors, (4499), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-01-09 05:27:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4585 transitions. [2025-01-09 05:27:21,786 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4585 transitions. Word has length 77 [2025-01-09 05:27:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:21,788 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4585 transitions. [2025-01-09 05:27:21,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4585 transitions. [2025-01-09 05:27:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:21,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:21,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:27:21,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 491261492, now seen corresponding path program 1 times [2025-01-09 05:27:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037927870] [2025-01-09 05:27:21,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:21,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:21,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:21,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037927870] [2025-01-09 05:27:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037927870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872943153] [2025-01-09 05:27:21,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:21,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:21,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:21,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:21,966 INFO L87 Difference]: Start difference. First operand 2542 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:22,548 INFO L93 Difference]: Finished difference Result 3273 states and 5691 transitions. [2025-01-09 05:27:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:22,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:22,563 INFO L225 Difference]: With dead ends: 3273 [2025-01-09 05:27:22,564 INFO L226 Difference]: Without dead ends: 2863 [2025-01-09 05:27:22,567 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-01-09 05:27:22,568 INFO L435 NwaCegarLoop]: 4233 mSDtfsCounter, 4328 mSDsluCounter, 12672 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4339 SdHoareTripleChecker+Valid, 16905 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:22,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4339 Valid, 16905 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:27:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2025-01-09 05:27:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2817. [2025-01-09 05:27:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2714 states have (on average 1.7877671333824614) internal successors, (4852), 2722 states have internal predecessors, (4852), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 05:27:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4998 transitions. [2025-01-09 05:27:22,684 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4998 transitions. Word has length 77 [2025-01-09 05:27:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 2817 states and 4998 transitions. [2025-01-09 05:27:22,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4998 transitions. [2025-01-09 05:27:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:22,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:22,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:27:22,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1842131146, now seen corresponding path program 1 times [2025-01-09 05:27:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002524469] [2025-01-09 05:27:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:22,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:22,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:22,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:22,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002524469] [2025-01-09 05:27:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002524469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192991005] [2025-01-09 05:27:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:22,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:22,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:22,846 INFO L87 Difference]: Start difference. First operand 2817 states and 4998 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:23,352 INFO L93 Difference]: Finished difference Result 4138 states and 7014 transitions. [2025-01-09 05:27:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:23,378 INFO L225 Difference]: With dead ends: 4138 [2025-01-09 05:27:23,378 INFO L226 Difference]: Without dead ends: 3453 [2025-01-09 05:27:23,383 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-01-09 05:27:23,384 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4323 mSDsluCounter, 12663 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16893 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:23,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16893 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:27:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-01-09 05:27:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3400. [2025-01-09 05:27:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3211 states have (on average 1.7452507007162879) internal successors, (5604), 3233 states have internal predecessors, (5604), 113 states have call successors, (113), 54 states have call predecessors, (113), 74 states have return successors, (177), 120 states have call predecessors, (177), 113 states have call successors, (177) [2025-01-09 05:27:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 5894 transitions. [2025-01-09 05:27:23,529 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 5894 transitions. Word has length 77 [2025-01-09 05:27:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:23,530 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 5894 transitions. [2025-01-09 05:27:23,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 5894 transitions. [2025-01-09 05:27:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:23,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:23,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:23,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:27:23,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:23,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1640307212, now seen corresponding path program 1 times [2025-01-09 05:27:23,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181830734] [2025-01-09 05:27:23,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:23,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:23,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:23,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:23,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:23,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181830734] [2025-01-09 05:27:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181830734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:23,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:23,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86660651] [2025-01-09 05:27:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:23,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:23,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:23,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:23,654 INFO L87 Difference]: Start difference. First operand 3400 states and 5894 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:24,651 INFO L93 Difference]: Finished difference Result 6189 states and 10233 transitions. [2025-01-09 05:27:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:24,682 INFO L225 Difference]: With dead ends: 6189 [2025-01-09 05:27:24,682 INFO L226 Difference]: Without dead ends: 4921 [2025-01-09 05:27:24,690 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-01-09 05:27:24,691 INFO L435 NwaCegarLoop]: 4225 mSDtfsCounter, 4422 mSDsluCounter, 12643 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16868 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:24,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 16868 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:27:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2025-01-09 05:27:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 4623. [2025-01-09 05:27:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4252 states have (on average 1.6923800564440263) internal successors, (7196), 4320 states have internal predecessors, (7196), 201 states have call successors, (201), 102 states have call predecessors, (201), 168 states have return successors, (457), 216 states have call predecessors, (457), 201 states have call successors, (457) [2025-01-09 05:27:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 7854 transitions. [2025-01-09 05:27:24,936 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 7854 transitions. Word has length 77 [2025-01-09 05:27:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:24,937 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 7854 transitions. [2025-01-09 05:27:24,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 7854 transitions. [2025-01-09 05:27:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:24,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:24,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:24,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:27:24,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:24,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1079607434, now seen corresponding path program 1 times [2025-01-09 05:27:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554073806] [2025-01-09 05:27:24,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:24,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554073806] [2025-01-09 05:27:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554073806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814628194] [2025-01-09 05:27:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:25,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:25,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:25,068 INFO L87 Difference]: Start difference. First operand 4623 states and 7854 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:25,805 INFO L93 Difference]: Finished difference Result 10148 states and 16867 transitions. [2025-01-09 05:27:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:25,878 INFO L225 Difference]: With dead ends: 10148 [2025-01-09 05:27:25,878 INFO L226 Difference]: Without dead ends: 7657 [2025-01-09 05:27:25,890 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-01-09 05:27:25,891 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4335 mSDsluCounter, 12631 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:25,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4345 Valid, 16852 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:27:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7657 states. [2025-01-09 05:27:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7657 to 7170. [2025-01-09 05:27:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 6389 states have (on average 1.6371889184535922) internal successors, (10460), 6603 states have internal predecessors, (10460), 369 states have call successors, (369), 198 states have call predecessors, (369), 410 states have return successors, (1393), 400 states have call predecessors, (1393), 369 states have call successors, (1393) [2025-01-09 05:27:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 12222 transitions. [2025-01-09 05:27:26,329 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 12222 transitions. Word has length 77 [2025-01-09 05:27:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:26,330 INFO L471 AbstractCegarLoop]: Abstraction has 7170 states and 12222 transitions. [2025-01-09 05:27:26,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 12222 transitions. [2025-01-09 05:27:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:26,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:26,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:27:26,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:26,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -645878348, now seen corresponding path program 1 times [2025-01-09 05:27:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778952832] [2025-01-09 05:27:26,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:26,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:26,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:26,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:26,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:26,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778952832] [2025-01-09 05:27:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778952832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:27:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918942315] [2025-01-09 05:27:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:26,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:27:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:26,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:27:26,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:26,462 INFO L87 Difference]: Start difference. First operand 7170 states and 12222 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:27,674 INFO L93 Difference]: Finished difference Result 17817 states and 31117 transitions. [2025-01-09 05:27:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:27:27,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:27,764 INFO L225 Difference]: With dead ends: 17817 [2025-01-09 05:27:27,764 INFO L226 Difference]: Without dead ends: 12779 [2025-01-09 05:27:27,793 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-01-09 05:27:27,794 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4319 mSDsluCounter, 12615 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16830 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:27,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16830 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:27:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2025-01-09 05:27:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 12442. [2025-01-09 05:27:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 10695 states have (on average 1.579242636746143) internal successors, (16890), 11363 states have internal predecessors, (16890), 689 states have call successors, (689), 390 states have call predecessors, (689), 1056 states have return successors, (4785), 752 states have call predecessors, (4785), 689 states have call successors, (4785) [2025-01-09 05:27:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 22364 transitions. [2025-01-09 05:27:28,729 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 22364 transitions. Word has length 77 [2025-01-09 05:27:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:28,729 INFO L471 AbstractCegarLoop]: Abstraction has 12442 states and 22364 transitions. [2025-01-09 05:27:28,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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-01-09 05:27:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 22364 transitions. [2025-01-09 05:27:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:27:28,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:28,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:27:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:27:28,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -605203598, now seen corresponding path program 1 times [2025-01-09 05:27:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923064751] [2025-01-09 05:27:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:28,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:27:28,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:27:28,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:28,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:27:28,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:28,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923064751] [2025-01-09 05:27:28,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923064751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:28,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:27:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:27:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561264380] [2025-01-09 05:27:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:28,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:27:28,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:28,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:27:28,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:27:28,811 INFO L87 Difference]: Start difference. First operand 12442 states and 22364 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-09 05:27:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:30,063 INFO L93 Difference]: Finished difference Result 28333 states and 50835 transitions. [2025-01-09 05:27:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:27:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 77 [2025-01-09 05:27:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:30,166 INFO L225 Difference]: With dead ends: 28333 [2025-01-09 05:27:30,166 INFO L226 Difference]: Without dead ends: 18024 [2025-01-09 05:27:30,209 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-01-09 05:27:30,213 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 4333 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 8669 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:30,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 8669 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:27:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18024 states. [2025-01-09 05:27:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18024 to 17181. [2025-01-09 05:27:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17181 states, 14659 states have (on average 1.5445801214271095) internal successors, (22642), 15572 states have internal predecessors, (22642), 1054 states have call successors, (1054), 588 states have call predecessors, (1054), 1466 states have return successors, (6143), 1084 states have call predecessors, (6143), 1054 states have call successors, (6143) [2025-01-09 05:27:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17181 states to 17181 states and 29839 transitions. [2025-01-09 05:27:31,588 INFO L78 Accepts]: Start accepts. Automaton has 17181 states and 29839 transitions. Word has length 77 [2025-01-09 05:27:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:31,588 INFO L471 AbstractCegarLoop]: Abstraction has 17181 states and 29839 transitions. [2025-01-09 05:27:31,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-01-09 05:27:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 17181 states and 29839 transitions. [2025-01-09 05:27:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:27:31,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:31,657 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, 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] [2025-01-09 05:27:31,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:27:31,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:31,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:31,658 INFO L85 PathProgramCache]: Analyzing trace with hash -146393991, now seen corresponding path program 1 times [2025-01-09 05:27:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:31,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134965724] [2025-01-09 05:27:31,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:27:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:31,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134965724] [2025-01-09 05:27:31,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134965724] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:27:31,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515217834] [2025-01-09 05:27:31,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:31,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:27:31,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:27:31,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:31,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:31,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:27:31,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:27:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 05:27:31,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:27:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515217834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:31,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:27:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:27:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058597311] [2025-01-09 05:27:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:31,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:31,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:31,995 INFO L87 Difference]: Start difference. First operand 17181 states and 29839 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-01-09 05:27:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:33,261 INFO L93 Difference]: Finished difference Result 46930 states and 81419 transitions. [2025-01-09 05:27:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 125 [2025-01-09 05:27:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:33,585 INFO L225 Difference]: With dead ends: 46930 [2025-01-09 05:27:33,586 INFO L226 Difference]: Without dead ends: 31882 [2025-01-09 05:27:33,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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-01-09 05:27:33,628 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4132 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 4371 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-01-09 05:27:33,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4132 Valid, 4371 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31882 states. [2025-01-09 05:27:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31882 to 31782. [2025-01-09 05:27:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31782 states, 26794 states have (on average 1.5161976561916848) internal successors, (40625), 28618 states have internal predecessors, (40625), 2054 states have call successors, (2054), 1176 states have call predecessors, (2054), 2932 states have return successors, (12169), 2051 states have call predecessors, (12169), 2054 states have call successors, (12169) [2025-01-09 05:27:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31782 states to 31782 states and 54848 transitions. [2025-01-09 05:27:35,496 INFO L78 Accepts]: Start accepts. Automaton has 31782 states and 54848 transitions. Word has length 125 [2025-01-09 05:27:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 31782 states and 54848 transitions. [2025-01-09 05:27:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-01-09 05:27:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 31782 states and 54848 transitions. [2025-01-09 05:27:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:27:35,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:35,587 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, 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] [2025-01-09 05:27:35,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:27:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:27:35,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -580185093, now seen corresponding path program 1 times [2025-01-09 05:27:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011862547] [2025-01-09 05:27:35,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:35,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:35,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:27:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011862547] [2025-01-09 05:27:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011862547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:27:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759195960] [2025-01-09 05:27:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:35,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:27:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:27:35,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:36,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:27:36,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:27:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 05:27:36,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:27:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759195960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:36,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:27:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:27:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848350068] [2025-01-09 05:27:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:36,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:36,109 INFO L87 Difference]: Start difference. First operand 31782 states and 54848 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-01-09 05:27:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:38,613 INFO L93 Difference]: Finished difference Result 90387 states and 156314 transitions. [2025-01-09 05:27:38,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 125 [2025-01-09 05:27:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:38,950 INFO L225 Difference]: With dead ends: 90387 [2025-01-09 05:27:38,951 INFO L226 Difference]: Without dead ends: 60738 [2025-01-09 05:27:39,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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-01-09 05:27:39,039 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4126 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 4371 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-01-09 05:27:39,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 4371 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60738 states. [2025-01-09 05:27:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60738 to 60540. [2025-01-09 05:27:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60540 states, 50670 states have (on average 1.4979869745411487) internal successors, (75903), 54316 states have internal predecessors, (75903), 4004 states have call successors, (4004), 2352 states have call predecessors, (4004), 5864 states have return successors, (24171), 3935 states have call predecessors, (24171), 4004 states have call successors, (24171) [2025-01-09 05:27:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60540 states to 60540 states and 104078 transitions. [2025-01-09 05:27:42,751 INFO L78 Accepts]: Start accepts. Automaton has 60540 states and 104078 transitions. Word has length 125 [2025-01-09 05:27:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 60540 states and 104078 transitions. [2025-01-09 05:27:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-01-09 05:27:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60540 states and 104078 transitions. [2025-01-09 05:27:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:27:42,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:42,840 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, 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] [2025-01-09 05:27:42,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:27:43,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:43,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:43,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash -91865859, now seen corresponding path program 1 times [2025-01-09 05:27:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660655687] [2025-01-09 05:27:43,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:43,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:43,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:43,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:43,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:43,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:27:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660655687] [2025-01-09 05:27:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660655687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:27:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272949847] [2025-01-09 05:27:43,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:43,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:27:43,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:27:43,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:27:43,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:27:43,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:43,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:43,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:27:43,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:27:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:27:43,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:27:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272949847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:43,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:27:43,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:27:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413331856] [2025-01-09 05:27:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:43,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:43,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:43,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:43,287 INFO L87 Difference]: Start difference. First operand 60540 states and 104078 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-09 05:27:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:46,734 INFO L93 Difference]: Finished difference Result 97774 states and 164571 transitions. [2025-01-09 05:27:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 125 [2025-01-09 05:27:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:47,364 INFO L225 Difference]: With dead ends: 97774 [2025-01-09 05:27:47,364 INFO L226 Difference]: Without dead ends: 78628 [2025-01-09 05:27:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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-01-09 05:27:47,430 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8542 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:27:47,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8542 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78628 states. [2025-01-09 05:27:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78628 to 78628. [2025-01-09 05:27:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78628 states, 65858 states have (on average 1.4916183303471104) internal successors, (98235), 70352 states have internal predecessors, (98235), 5264 states have call successors, (5264), 3144 states have call predecessors, (5264), 7504 states have return successors, (29871), 5195 states have call predecessors, (29871), 5264 states have call successors, (29871) [2025-01-09 05:27:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78628 states to 78628 states and 133370 transitions. [2025-01-09 05:27:50,954 INFO L78 Accepts]: Start accepts. Automaton has 78628 states and 133370 transitions. Word has length 125 [2025-01-09 05:27:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:27:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 78628 states and 133370 transitions. [2025-01-09 05:27:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-01-09 05:27:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78628 states and 133370 transitions. [2025-01-09 05:27:51,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 05:27:51,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:27:51,167 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, 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, 1, 1] [2025-01-09 05:27:51,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:27:51,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:51,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:27:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:27:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -8230779, now seen corresponding path program 1 times [2025-01-09 05:27:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:27:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315660207] [2025-01-09 05:27:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:27:51,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 05:27:51,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 05:27:51,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:51,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 05:27:51,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:27:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315660207] [2025-01-09 05:27:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315660207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:27:51,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820567500] [2025-01-09 05:27:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:27:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:27:51,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:51,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:27:51,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:27:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 05:27:51,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 05:27:51,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:27:51,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:27:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:27:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:27:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:27:51,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:27:51,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820567500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:27:51,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:27:51,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:27:51,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792485775] [2025-01-09 05:27:51,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:27:51,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:27:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:27:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:27:51,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:27:51,755 INFO L87 Difference]: Start difference. First operand 78628 states and 133370 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:27:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:27:57,552 INFO L93 Difference]: Finished difference Result 228562 states and 389496 transitions. [2025-01-09 05:27:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:27:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 163 [2025-01-09 05:27:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:27:58,314 INFO L225 Difference]: With dead ends: 228562 [2025-01-09 05:27:58,314 INFO L226 Difference]: Without dead ends: 152067 [2025-01-09 05:27:58,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 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-01-09 05:27:58,510 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4084 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4379 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-01-09 05:27:58,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4379 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:27:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152067 states.