./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.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/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.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 6ccc8126940cf3f46bcb3993cc3f2567a1d57b3d9eef9ad8f60ee950111ffdfc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:46:25,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:46:25,218 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:46:25,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:46:25,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:46:25,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:46:25,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:46:25,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:46:25,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:46:25,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:46:25,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:46:25,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:46:25,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:46:25,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:46:25,254 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:46:25,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:46:25,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:46:25,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:46:25,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:46:25,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:46:25,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:46:25,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:46:25,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:25,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:46:25,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:25,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:46:25,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:46:25,259 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 -> 6ccc8126940cf3f46bcb3993cc3f2567a1d57b3d9eef9ad8f60ee950111ffdfc [2025-01-09 05:46:25,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:46:25,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:46:25,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:46:25,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:46:25,528 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:46:25,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2025-01-09 05:46:26,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f67a991d/5a5edfa7ce0d498a8bc4b2ae8750f090/FLAG09eddd781 [2025-01-09 05:46:27,347 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:46:27,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2025-01-09 05:46:27,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f67a991d/5a5edfa7ce0d498a8bc4b2ae8750f090/FLAG09eddd781 [2025-01-09 05:46:27,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f67a991d/5a5edfa7ce0d498a8bc4b2ae8750f090 [2025-01-09 05:46:27,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:46:27,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:46:27,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:46:27,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:46:27,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:46:27,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:46:27" (1/1) ... [2025-01-09 05:46:27,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7ca60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:27, skipping insertion in model container [2025-01-09 05:46:27,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:46:27" (1/1) ... [2025-01-09 05:46:27,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:46:27,788 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/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[8616,8629] [2025-01-09 05:46:27,827 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/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[11433,11446] [2025-01-09 05:46:28,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:46:28,378 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:46:28,419 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/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[8616,8629] [2025-01-09 05:46:28,424 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/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c[11433,11446] [2025-01-09 05:46:28,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:46:28,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:46:28,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28 WrapperNode [2025-01-09 05:46:28,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:46:28,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:46:28,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:46:28,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:46:28,772 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:46:28" (1/1) ... [2025-01-09 05:46:28,827 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:46:28" (1/1) ... [2025-01-09 05:46:29,113 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-01-09 05:46:29,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:46:29,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:46:29,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:46:29,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:46:29,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,465 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:46:29,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:46:29,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:46:29,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:46:29,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:46:29,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (1/1) ... [2025-01-09 05:46:29,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:29,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:29,827 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:46:29,834 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:46:29,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:46:29,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:46:29,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:46:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:46:29,962 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:46:29,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:46:34,341 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-01-09 05:46:34,341 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:46:34,381 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:46:34,381 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:46:34,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:46:34 BoogieIcfgContainer [2025-01-09 05:46:34,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:46:34,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:46:34,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:46:34,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:46:34,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:46:27" (1/3) ... [2025-01-09 05:46:34,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb78c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:46:34, skipping insertion in model container [2025-01-09 05:46:34,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:28" (2/3) ... [2025-01-09 05:46:34,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcb78c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:46:34, skipping insertion in model container [2025-01-09 05:46:34,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:46:34" (3/3) ... [2025-01-09 05:46:34,392 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c [2025-01-09 05:46:34,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:46:34,408 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label06.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:46:34,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:46:34,502 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;@63b9c9c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:46:34,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:46:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:46:34,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:34,519 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] [2025-01-09 05:46:34,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1605999950, now seen corresponding path program 1 times [2025-01-09 05:46:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934100390] [2025-01-09 05:46:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:34,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:46:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:46:34,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:34,731 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:46:34,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934100390] [2025-01-09 05:46:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934100390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:46:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642463426] [2025-01-09 05:46:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:46:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:34,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:46:34,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:46:34,757 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:34,823 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-01-09 05:46:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:46:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:46:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:34,844 INFO L225 Difference]: With dead ends: 1739 [2025-01-09 05:46:34,844 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:46:34,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:46:34,855 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:34,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:46:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:46:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-01-09 05:46:34,935 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-01-09 05:46:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:34,936 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-01-09 05:46:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-01-09 05:46:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:46:34,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:34,939 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] [2025-01-09 05:46:34,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:46:34,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:34,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash 584931596, now seen corresponding path program 1 times [2025-01-09 05:46:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:34,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105340240] [2025-01-09 05:46:34,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:34,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:46:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:46:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:35,185 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:46:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105340240] [2025-01-09 05:46:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105340240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:46:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230449200] [2025-01-09 05:46:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:46:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:35,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:46:35,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:35,190 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:35,306 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-01-09 05:46:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:46:35,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:46:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:35,311 INFO L225 Difference]: With dead ends: 895 [2025-01-09 05:46:35,311 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 05:46:35,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:35,313 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:35,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 05:46:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-01-09 05:46:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-01-09 05:46:35,374 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-01-09 05:46:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-01-09 05:46:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-01-09 05:46:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:46:35,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:35,376 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] [2025-01-09 05:46:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:46:35,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -616978800, now seen corresponding path program 1 times [2025-01-09 05:46:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350390599] [2025-01-09 05:46:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:35,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:46:35,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:46:35,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:35,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:35,454 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:46:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:35,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350390599] [2025-01-09 05:46:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350390599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:46:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724049424] [2025-01-09 05:46:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:35,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:35,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:35,456 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:38,987 INFO L93 Difference]: Finished difference Result 2323 states and 4398 transitions. [2025-01-09 05:46:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:38,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 05:46:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:38,995 INFO L225 Difference]: With dead ends: 2323 [2025-01-09 05:46:38,995 INFO L226 Difference]: Without dead ends: 1570 [2025-01-09 05:46:38,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:46:38,999 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 863 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:39,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 561 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 05:46:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-01-09 05:46:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-01-09 05:46:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1568 states have (on average 1.596938775510204) internal successors, (2504), 1569 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2504 transitions. [2025-01-09 05:46:39,047 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2504 transitions. Word has length 24 [2025-01-09 05:46:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:39,047 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2504 transitions. [2025-01-09 05:46:39,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2504 transitions. [2025-01-09 05:46:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:46:39,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:39,050 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] [2025-01-09 05:46:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:46:39,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1015331463, now seen corresponding path program 1 times [2025-01-09 05:46:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588401651] [2025-01-09 05:46:39,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:39,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:46:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:46:39,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:39,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:39,268 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:46:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588401651] [2025-01-09 05:46:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588401651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688280155] [2025-01-09 05:46:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:39,271 INFO L87 Difference]: Start difference. First operand 1570 states and 2504 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:39,459 INFO L93 Difference]: Finished difference Result 1858 states and 2960 transitions. [2025-01-09 05:46:39,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:46:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 05:46:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:39,469 INFO L225 Difference]: With dead ends: 1858 [2025-01-09 05:46:39,469 INFO L226 Difference]: Without dead ends: 1822 [2025-01-09 05:46:39,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:46:39,471 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:39,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-01-09 05:46:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1604. [2025-01-09 05:46:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.5967540574282146) internal successors, (2558), 1603 states have internal predecessors, (2558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2558 transitions. [2025-01-09 05:46:39,520 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2558 transitions. Word has length 44 [2025-01-09 05:46:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2558 transitions. [2025-01-09 05:46:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2558 transitions. [2025-01-09 05:46:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:46:39,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:39,522 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] [2025-01-09 05:46:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:46:39,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -639739561, now seen corresponding path program 1 times [2025-01-09 05:46:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270748955] [2025-01-09 05:46:39,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:39,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:46:39,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:46:39,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:39,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:39,625 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:46:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270748955] [2025-01-09 05:46:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270748955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939692119] [2025-01-09 05:46:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:39,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:39,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:39,627 INFO L87 Difference]: Start difference. First operand 1604 states and 2558 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:39,661 INFO L93 Difference]: Finished difference Result 1733 states and 2761 transitions. [2025-01-09 05:46:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:39,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:46:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:39,669 INFO L225 Difference]: With dead ends: 1733 [2025-01-09 05:46:39,669 INFO L226 Difference]: Without dead ends: 1663 [2025-01-09 05:46:39,670 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:46:39,671 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:39,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-01-09 05:46:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1661. [2025-01-09 05:46:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.5949367088607596) internal successors, (2646), 1660 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2646 transitions. [2025-01-09 05:46:39,711 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2646 transitions. Word has length 46 [2025-01-09 05:46:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:39,711 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2646 transitions. [2025-01-09 05:46:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2646 transitions. [2025-01-09 05:46:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:46:39,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:39,713 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] [2025-01-09 05:46:39,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:46:39,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -573246049, now seen corresponding path program 1 times [2025-01-09 05:46:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179010688] [2025-01-09 05:46:39,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:39,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:46:39,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:46:39,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:39,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:39,958 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:46:39,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179010688] [2025-01-09 05:46:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179010688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:39,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936555838] [2025-01-09 05:46:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:39,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:39,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:39,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:39,961 INFO L87 Difference]: Start difference. First operand 1661 states and 2646 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:40,083 INFO L93 Difference]: Finished difference Result 1790 states and 2846 transitions. [2025-01-09 05:46:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:46:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:40,091 INFO L225 Difference]: With dead ends: 1790 [2025-01-09 05:46:40,091 INFO L226 Difference]: Without dead ends: 1663 [2025-01-09 05:46:40,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:46:40,094 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:40,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-01-09 05:46:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1661. [2025-01-09 05:46:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.5937311633514166) internal successors, (2644), 1660 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2644 transitions. [2025-01-09 05:46:40,137 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2644 transitions. Word has length 46 [2025-01-09 05:46:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:40,137 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2644 transitions. [2025-01-09 05:46:40,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2644 transitions. [2025-01-09 05:46:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:46:40,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:40,141 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] [2025-01-09 05:46:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:46:40,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1005481493, now seen corresponding path program 1 times [2025-01-09 05:46:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937696631] [2025-01-09 05:46:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:40,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:46:40,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:46:40,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:40,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:40,392 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:46:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937696631] [2025-01-09 05:46:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937696631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:46:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461579709] [2025-01-09 05:46:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:40,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:46:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:40,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:46:40,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:40,395 INFO L87 Difference]: Start difference. First operand 1661 states and 2644 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:40,431 INFO L93 Difference]: Finished difference Result 1669 states and 2653 transitions. [2025-01-09 05:46:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:46:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 05:46:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:40,437 INFO L225 Difference]: With dead ends: 1669 [2025-01-09 05:46:40,437 INFO L226 Difference]: Without dead ends: 1667 [2025-01-09 05:46:40,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:40,438 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:40,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-01-09 05:46:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2025-01-09 05:46:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.590990990990991) internal successors, (2649), 1666 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2649 transitions. [2025-01-09 05:46:40,479 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2649 transitions. Word has length 47 [2025-01-09 05:46:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2649 transitions. [2025-01-09 05:46:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2649 transitions. [2025-01-09 05:46:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:40,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:40,482 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] [2025-01-09 05:46:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:46:40,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash -467852289, now seen corresponding path program 1 times [2025-01-09 05:46:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731438460] [2025-01-09 05:46:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:40,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:40,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:40,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:40,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:40,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:40,545 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:46:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731438460] [2025-01-09 05:46:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731438460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603443357] [2025-01-09 05:46:40,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:40,548 INFO L87 Difference]: Start difference. First operand 1667 states and 2649 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:40,574 INFO L93 Difference]: Finished difference Result 1813 states and 2870 transitions. [2025-01-09 05:46:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:46:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:40,581 INFO L225 Difference]: With dead ends: 1813 [2025-01-09 05:46:40,581 INFO L226 Difference]: Without dead ends: 1737 [2025-01-09 05:46:40,582 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:46:40,582 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:40,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-01-09 05:46:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1735. [2025-01-09 05:46:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1733 states have (on average 1.5868436237738026) internal successors, (2750), 1734 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2750 transitions. [2025-01-09 05:46:40,623 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2750 transitions. Word has length 48 [2025-01-09 05:46:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2750 transitions. [2025-01-09 05:46:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2750 transitions. [2025-01-09 05:46:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:40,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:40,624 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] [2025-01-09 05:46:40,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:46:40,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:40,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash 770409727, now seen corresponding path program 1 times [2025-01-09 05:46:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:40,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503105041] [2025-01-09 05:46:40,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:40,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:40,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:40,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:40,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:40,685 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:46:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503105041] [2025-01-09 05:46:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503105041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:40,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:40,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091071018] [2025-01-09 05:46:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:40,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:40,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:40,686 INFO L87 Difference]: Start difference. First operand 1735 states and 2750 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:40,714 INFO L93 Difference]: Finished difference Result 2109 states and 3310 transitions. [2025-01-09 05:46:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:46:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:40,721 INFO L225 Difference]: With dead ends: 2109 [2025-01-09 05:46:40,722 INFO L226 Difference]: Without dead ends: 1910 [2025-01-09 05:46:40,723 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:46:40,723 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:40,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-01-09 05:46:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1908. [2025-01-09 05:46:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1906 states have (on average 1.5750262329485833) internal successors, (3002), 1907 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 3002 transitions. [2025-01-09 05:46:40,768 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 3002 transitions. Word has length 48 [2025-01-09 05:46:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:40,769 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 3002 transitions. [2025-01-09 05:46:40,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3002 transitions. [2025-01-09 05:46:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:40,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:40,770 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] [2025-01-09 05:46:40,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:46:40,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:40,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1445059073, now seen corresponding path program 1 times [2025-01-09 05:46:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:40,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708296221] [2025-01-09 05:46:40,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:40,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:40,851 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:46:40,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:40,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708296221] [2025-01-09 05:46:40,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708296221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:40,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:40,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944236325] [2025-01-09 05:46:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:40,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:40,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:40,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:40,853 INFO L87 Difference]: Start difference. First operand 1908 states and 3002 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:40,888 INFO L93 Difference]: Finished difference Result 2604 states and 4024 transitions. [2025-01-09 05:46:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:46:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:40,897 INFO L225 Difference]: With dead ends: 2604 [2025-01-09 05:46:40,898 INFO L226 Difference]: Without dead ends: 2232 [2025-01-09 05:46:40,899 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:46:40,901 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:40,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-01-09 05:46:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2230. [2025-01-09 05:46:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2228 states have (on average 1.552064631956912) internal successors, (3458), 2229 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3458 transitions. [2025-01-09 05:46:40,958 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3458 transitions. Word has length 48 [2025-01-09 05:46:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3458 transitions. [2025-01-09 05:46:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3458 transitions. [2025-01-09 05:46:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:40,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:40,959 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] [2025-01-09 05:46:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:46:40,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash 335873791, now seen corresponding path program 1 times [2025-01-09 05:46:40,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180801363] [2025-01-09 05:46:40,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:40,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:40,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:41,022 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:46:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180801363] [2025-01-09 05:46:41,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180801363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:41,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472632704] [2025-01-09 05:46:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:41,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:41,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:41,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:41,024 INFO L87 Difference]: Start difference. First operand 2230 states and 3458 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:41,064 INFO L93 Difference]: Finished difference Result 3522 states and 5308 transitions. [2025-01-09 05:46:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:46:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:41,076 INFO L225 Difference]: With dead ends: 3522 [2025-01-09 05:46:41,076 INFO L226 Difference]: Without dead ends: 2828 [2025-01-09 05:46:41,078 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:46:41,080 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2025-01-09 05:46:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2826. [2025-01-09 05:46:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2824 states have (on average 1.5134560906515582) internal successors, (4274), 2825 states have internal predecessors, (4274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4274 transitions. [2025-01-09 05:46:41,154 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4274 transitions. Word has length 48 [2025-01-09 05:46:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:41,154 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4274 transitions. [2025-01-09 05:46:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4274 transitions. [2025-01-09 05:46:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:41,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:41,156 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:41,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:46:41,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -161363137, now seen corresponding path program 1 times [2025-01-09 05:46:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874482693] [2025-01-09 05:46:41,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:41,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:41,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:41,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:46:41,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874482693] [2025-01-09 05:46:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874482693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:41,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964204979] [2025-01-09 05:46:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:41,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:41,310 INFO L87 Difference]: Start difference. First operand 2826 states and 4274 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:41,521 INFO L93 Difference]: Finished difference Result 7916 states and 11463 transitions. [2025-01-09 05:46:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:41,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:46:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:41,545 INFO L225 Difference]: With dead ends: 7916 [2025-01-09 05:46:41,546 INFO L226 Difference]: Without dead ends: 6986 [2025-01-09 05:46:41,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:46:41,549 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:41,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2025-01-09 05:46:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 3938. [2025-01-09 05:46:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3936 states have (on average 1.4801829268292683) internal successors, (5826), 3937 states have internal predecessors, (5826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 5826 transitions. [2025-01-09 05:46:41,673 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 5826 transitions. Word has length 65 [2025-01-09 05:46:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:41,673 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 5826 transitions. [2025-01-09 05:46:41,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 5826 transitions. [2025-01-09 05:46:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:41,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:41,676 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:41,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:46:41,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1076898879, now seen corresponding path program 1 times [2025-01-09 05:46:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423245787] [2025-01-09 05:46:41,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:41,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:41,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:41,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:41,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:46:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423245787] [2025-01-09 05:46:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423245787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:41,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:41,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734656301] [2025-01-09 05:46:41,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:41,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:41,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:41,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:41,801 INFO L87 Difference]: Start difference. First operand 3938 states and 5826 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:42,012 INFO L93 Difference]: Finished difference Result 9204 states and 13271 transitions. [2025-01-09 05:46:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:46:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:42,045 INFO L225 Difference]: With dead ends: 9204 [2025-01-09 05:46:42,046 INFO L226 Difference]: Without dead ends: 7914 [2025-01-09 05:46:42,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:46:42,052 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:42,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2025-01-09 05:46:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 5690. [2025-01-09 05:46:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5688 states have (on average 1.4532348804500703) internal successors, (8266), 5689 states have internal predecessors, (8266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8266 transitions. [2025-01-09 05:46:42,221 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8266 transitions. Word has length 65 [2025-01-09 05:46:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:42,221 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8266 transitions. [2025-01-09 05:46:42,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8266 transitions. [2025-01-09 05:46:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:42,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:42,223 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:42,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:46:42,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:42,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1138569921, now seen corresponding path program 1 times [2025-01-09 05:46:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509322005] [2025-01-09 05:46:42,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:42,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:46:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:42,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509322005] [2025-01-09 05:46:42,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509322005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:42,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:42,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545775307] [2025-01-09 05:46:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:42,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:42,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:42,461 INFO L87 Difference]: Start difference. First operand 5690 states and 8266 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:42,848 INFO L93 Difference]: Finished difference Result 10492 states and 15071 transitions. [2025-01-09 05:46:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:46:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:42,871 INFO L225 Difference]: With dead ends: 10492 [2025-01-09 05:46:42,871 INFO L226 Difference]: Without dead ends: 9202 [2025-01-09 05:46:42,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:46:42,878 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4669 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:42,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 3349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:46:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9202 states. [2025-01-09 05:46:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9202 to 6978. [2025-01-09 05:46:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6978 states, 6976 states have (on average 1.442947247706422) internal successors, (10066), 6977 states have internal predecessors, (10066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6978 states to 6978 states and 10066 transitions. [2025-01-09 05:46:43,077 INFO L78 Accepts]: Start accepts. Automaton has 6978 states and 10066 transitions. Word has length 65 [2025-01-09 05:46:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:43,077 INFO L471 AbstractCegarLoop]: Abstraction has 6978 states and 10066 transitions. [2025-01-09 05:46:43,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 6978 states and 10066 transitions. [2025-01-09 05:46:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:43,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:43,082 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:46:43,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 642362943, now seen corresponding path program 1 times [2025-01-09 05:46:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141003452] [2025-01-09 05:46:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:43,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:43,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:46:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141003452] [2025-01-09 05:46:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141003452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349175045] [2025-01-09 05:46:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:43,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:43,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:43,250 INFO L87 Difference]: Start difference. First operand 6978 states and 10066 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:43,457 INFO L93 Difference]: Finished difference Result 11780 states and 16871 transitions. [2025-01-09 05:46:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:43,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:46:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:43,480 INFO L225 Difference]: With dead ends: 11780 [2025-01-09 05:46:43,481 INFO L226 Difference]: Without dead ends: 10490 [2025-01-09 05:46:43,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:46:43,488 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:43,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2025-01-09 05:46:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 8266. [2025-01-09 05:46:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.435866408518877) internal successors, (11866), 8265 states have internal predecessors, (11866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 11866 transitions. [2025-01-09 05:46:43,787 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 11866 transitions. Word has length 65 [2025-01-09 05:46:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:43,788 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 11866 transitions. [2025-01-09 05:46:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 11866 transitions. [2025-01-09 05:46:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 05:46:43,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:43,790 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:46:43,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:43,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1093101628, now seen corresponding path program 1 times [2025-01-09 05:46:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391675072] [2025-01-09 05:46:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:43,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 05:46:43,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 05:46:43,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:43,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391675072] [2025-01-09 05:46:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391675072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580219815] [2025-01-09 05:46:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:43,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:43,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:43,887 INFO L87 Difference]: Start difference. First operand 8266 states and 11866 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:44,008 INFO L93 Difference]: Finished difference Result 14998 states and 21284 transitions. [2025-01-09 05:46:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 05:46:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:44,027 INFO L225 Difference]: With dead ends: 14998 [2025-01-09 05:46:44,028 INFO L226 Difference]: Without dead ends: 8268 [2025-01-09 05:46:44,037 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:46:44,038 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:44,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2025-01-09 05:46:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8266. [2025-01-09 05:46:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.4208615682478218) internal successors, (11742), 8265 states have internal predecessors, (11742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 11742 transitions. [2025-01-09 05:46:44,303 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 11742 transitions. Word has length 66 [2025-01-09 05:46:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:44,307 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 11742 transitions. [2025-01-09 05:46:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 11742 transitions. [2025-01-09 05:46:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:46:44,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:44,309 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:44,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:46:44,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:44,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1536501417, now seen corresponding path program 1 times [2025-01-09 05:46:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158554955] [2025-01-09 05:46:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:44,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:46:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:46:44,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158554955] [2025-01-09 05:46:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158554955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:44,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7431460] [2025-01-09 05:46:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:44,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:44,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:44,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:44,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:44,556 INFO L87 Difference]: Start difference. First operand 8266 states and 11742 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:44,713 INFO L93 Difference]: Finished difference Result 10839 states and 15326 transitions. [2025-01-09 05:46:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:44,714 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:46:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:44,739 INFO L225 Difference]: With dead ends: 10839 [2025-01-09 05:46:44,739 INFO L226 Difference]: Without dead ends: 4109 [2025-01-09 05:46:44,756 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:46:44,760 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:44,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-01-09 05:46:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4101. [2025-01-09 05:46:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4099 states have (on average 1.4591363747255428) internal successors, (5981), 4100 states have internal predecessors, (5981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5981 transitions. [2025-01-09 05:46:44,896 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5981 transitions. Word has length 67 [2025-01-09 05:46:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:44,897 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 5981 transitions. [2025-01-09 05:46:44,897 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5981 transitions. [2025-01-09 05:46:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:46:44,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:44,899 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:46:44,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:44,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1693309582, now seen corresponding path program 1 times [2025-01-09 05:46:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:44,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502069492] [2025-01-09 05:46:44,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:44,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:46:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:46:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502069492] [2025-01-09 05:46:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502069492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401701192] [2025-01-09 05:46:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:44,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:44,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:44,999 INFO L87 Difference]: Start difference. First operand 4101 states and 5981 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:45,042 INFO L93 Difference]: Finished difference Result 5381 states and 7743 transitions. [2025-01-09 05:46:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:45,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:46:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:45,050 INFO L225 Difference]: With dead ends: 5381 [2025-01-09 05:46:45,050 INFO L226 Difference]: Without dead ends: 2827 [2025-01-09 05:46:45,054 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:46:45,055 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:45,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-01-09 05:46:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2825. [2025-01-09 05:46:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.4874247254693589) internal successors, (4199), 2824 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4199 transitions. [2025-01-09 05:46:45,106 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4199 transitions. Word has length 68 [2025-01-09 05:46:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4199 transitions. [2025-01-09 05:46:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4199 transitions. [2025-01-09 05:46:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:46:45,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:45,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:46:45,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:46:45,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2022357856, now seen corresponding path program 1 times [2025-01-09 05:46:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321916078] [2025-01-09 05:46:45,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:45,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:46:45,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:46:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:45,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:45,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321916078] [2025-01-09 05:46:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321916078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:45,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308223123] [2025-01-09 05:46:45,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:45,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:45,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:45,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:45,209 INFO L87 Difference]: Start difference. First operand 2825 states and 4199 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:45,237 INFO L93 Difference]: Finished difference Result 3467 states and 5070 transitions. [2025-01-09 05:46:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 05:46:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:45,242 INFO L225 Difference]: With dead ends: 3467 [2025-01-09 05:46:45,242 INFO L226 Difference]: Without dead ends: 2189 [2025-01-09 05:46:45,244 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:46:45,244 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:45,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-01-09 05:46:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2025-01-09 05:46:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.5189931350114416) internal successors, (3319), 2186 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3319 transitions. [2025-01-09 05:46:45,287 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3319 transitions. Word has length 70 [2025-01-09 05:46:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:45,288 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3319 transitions. [2025-01-09 05:46:45,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3319 transitions. [2025-01-09 05:46:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:46:45,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:45,289 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:46:45,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:46:45,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1521538382, now seen corresponding path program 1 times [2025-01-09 05:46:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969131199] [2025-01-09 05:46:45,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:45,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:46:45,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:46:45,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:45,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:46:45,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969131199] [2025-01-09 05:46:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969131199] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:45,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420841185] [2025-01-09 05:46:45,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:45,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:45,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:45,431 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:46:45,432 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:46:45,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:46:45,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:46:45,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:45,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:45,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:46:45,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:45,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420841185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:46,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:46,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-01-09 05:46:46,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277599952] [2025-01-09 05:46:46,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 05:46:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:46,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 05:46:46,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:46:46,190 INFO L87 Difference]: Start difference. First operand 2187 states and 3319 transitions. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:46,524 INFO L93 Difference]: Finished difference Result 4996 states and 6971 transitions. [2025-01-09 05:46:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:46:46,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 05:46:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:46,533 INFO L225 Difference]: With dead ends: 4996 [2025-01-09 05:46:46,533 INFO L226 Difference]: Without dead ends: 4319 [2025-01-09 05:46:46,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:46:46,535 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1916 mSDsluCounter, 6540 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 8139 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:46,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 8139 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:46:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2025-01-09 05:46:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3961. [2025-01-09 05:46:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3959 states have (on average 1.4069209396312201) internal successors, (5570), 3960 states have internal predecessors, (5570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5570 transitions. [2025-01-09 05:46:46,664 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5570 transitions. Word has length 72 [2025-01-09 05:46:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 3961 states and 5570 transitions. [2025-01-09 05:46:46,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5570 transitions. [2025-01-09 05:46:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:46:46,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:46,666 INFO L218 NwaCegarLoop]: trace histogram [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:46:46,674 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:46:46,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:46,867 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:46,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:46,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1308850337, now seen corresponding path program 1 times [2025-01-09 05:46:46,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:46,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006054964] [2025-01-09 05:46:46,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:46,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:46,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:46,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:46,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:46,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:47,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006054964] [2025-01-09 05:46:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006054964] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879226802] [2025-01-09 05:46:47,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:47,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:47,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:47,373 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:46:47,375 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:46:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:47,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:47,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:47,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:47,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:46:47,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:47,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:48,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879226802] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:48,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:48,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:46:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233259508] [2025-01-09 05:46:48,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:48,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:46:48,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:48,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:46:48,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:46:48,969 INFO L87 Difference]: Start difference. First operand 3961 states and 5570 transitions. Second operand has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:50,740 INFO L93 Difference]: Finished difference Result 13683 states and 18173 transitions. [2025-01-09 05:46:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:46:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 05:46:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:50,764 INFO L225 Difference]: With dead ends: 13683 [2025-01-09 05:46:50,764 INFO L226 Difference]: Without dead ends: 11290 [2025-01-09 05:46:50,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 05:46:50,773 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 24961 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24961 SdHoareTripleChecker+Valid, 6490 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:50,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24961 Valid, 6490 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:46:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11290 states. [2025-01-09 05:46:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11290 to 11142. [2025-01-09 05:46:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11142 states, 11140 states have (on average 1.3110412926391382) internal successors, (14605), 11141 states have internal predecessors, (14605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11142 states to 11142 states and 14605 transitions. [2025-01-09 05:46:51,089 INFO L78 Accepts]: Start accepts. Automaton has 11142 states and 14605 transitions. Word has length 73 [2025-01-09 05:46:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:51,089 INFO L471 AbstractCegarLoop]: Abstraction has 11142 states and 14605 transitions. [2025-01-09 05:46:51,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 11142 states and 14605 transitions. [2025-01-09 05:46:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:46:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:51,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:46:51,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:46:51,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:51,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:51,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1730489837, now seen corresponding path program 1 times [2025-01-09 05:46:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138079737] [2025-01-09 05:46:51,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:51,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:51,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:51,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138079737] [2025-01-09 05:46:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138079737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285432102] [2025-01-09 05:46:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:51,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:51,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:51,826 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:46:51,829 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:46:51,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:51,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:52,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 05:46:52,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:53,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285432102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:54,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:54,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 32 [2025-01-09 05:46:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846456228] [2025-01-09 05:46:54,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:54,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:46:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:54,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:46:54,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:46:54,340 INFO L87 Difference]: Start difference. First operand 11142 states and 14605 transitions. Second operand has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:59,054 INFO L93 Difference]: Finished difference Result 55934 states and 71781 transitions. [2025-01-09 05:46:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 05:46:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 05:46:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:59,120 INFO L225 Difference]: With dead ends: 55934 [2025-01-09 05:46:59,120 INFO L226 Difference]: Without dead ends: 46528 [2025-01-09 05:46:59,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1461, Invalid=5849, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 05:46:59,136 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 19639 mSDsluCounter, 9604 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19639 SdHoareTripleChecker+Valid, 11113 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:59,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19639 Valid, 11113 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:46:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46528 states. [2025-01-09 05:47:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46528 to 46372. [2025-01-09 05:47:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46372 states, 46370 states have (on average 1.2616778089281864) internal successors, (58504), 46371 states have internal predecessors, (58504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46372 states to 46372 states and 58504 transitions. [2025-01-09 05:47:00,553 INFO L78 Accepts]: Start accepts. Automaton has 46372 states and 58504 transitions. Word has length 73 [2025-01-09 05:47:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:00,554 INFO L471 AbstractCegarLoop]: Abstraction has 46372 states and 58504 transitions. [2025-01-09 05:47:00,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 46372 states and 58504 transitions. [2025-01-09 05:47:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:47:00,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:00,556 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:47:00,564 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:47:00,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:00,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -368926045, now seen corresponding path program 1 times [2025-01-09 05:47:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503576834] [2025-01-09 05:47:00,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:00,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:00,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:00,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:00,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503576834] [2025-01-09 05:47:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503576834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222532534] [2025-01-09 05:47:01,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:01,755 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:47:01,756 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:47:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:01,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:01,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:01,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:01,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 05:47:01,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:02,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222532534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:03,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-01-09 05:47:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087713101] [2025-01-09 05:47:03,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 05:47:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:03,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 05:47:03,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:47:03,111 INFO L87 Difference]: Start difference. First operand 46372 states and 58504 transitions. Second operand has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:09,574 INFO L93 Difference]: Finished difference Result 106796 states and 132808 transitions. [2025-01-09 05:47:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 05:47:09,575 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:47:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:09,695 INFO L225 Difference]: With dead ends: 106796 [2025-01-09 05:47:09,695 INFO L226 Difference]: Without dead ends: 83000 [2025-01-09 05:47:09,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1563, Invalid=6269, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 05:47:09,727 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 14935 mSDsluCounter, 22951 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14935 SdHoareTripleChecker+Valid, 24475 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:09,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14935 Valid, 24475 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:47:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83000 states. [2025-01-09 05:47:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83000 to 67534. [2025-01-09 05:47:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67534 states, 67532 states have (on average 1.2470088254457146) internal successors, (84213), 67533 states have internal predecessors, (84213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67534 states to 67534 states and 84213 transitions. [2025-01-09 05:47:12,682 INFO L78 Accepts]: Start accepts. Automaton has 67534 states and 84213 transitions. Word has length 75 [2025-01-09 05:47:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:12,683 INFO L471 AbstractCegarLoop]: Abstraction has 67534 states and 84213 transitions. [2025-01-09 05:47:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 67534 states and 84213 transitions. [2025-01-09 05:47:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:47:12,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:12,685 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:47:12,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:47:12,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 05:47:12,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1647941027, now seen corresponding path program 1 times [2025-01-09 05:47:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:12,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036900090] [2025-01-09 05:47:12,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:12,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:12,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:12,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:12,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:12,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036900090] [2025-01-09 05:47:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036900090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000438222] [2025-01-09 05:47:13,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:13,519 INFO L229 MonitoredProcess]: Starting monitored process 6 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:47:13,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:47:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:13,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:13,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:13,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:13,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 05:47:13,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:15,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000438222] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:18,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 28] total 60 [2025-01-09 05:47:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36402331] [2025-01-09 05:47:18,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 05:47:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:18,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 05:47:18,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=3064, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 05:47:18,885 INFO L87 Difference]: Start difference. First operand 67534 states and 84213 transitions. Second operand has 60 states, 60 states have (on average 3.316666666666667) internal successors, (199), 60 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:40,224 INFO L93 Difference]: Finished difference Result 195772 states and 245536 transitions. [2025-01-09 05:47:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2025-01-09 05:47:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.316666666666667) internal successors, (199), 60 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:47:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:40,472 INFO L225 Difference]: With dead ends: 195772 [2025-01-09 05:47:40,473 INFO L226 Difference]: Without dead ends: 170292 [2025-01-09 05:47:40,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15755 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=7187, Invalid=32215, Unknown=0, NotChecked=0, Total=39402 [2025-01-09 05:47:40,522 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 25847 mSDsluCounter, 18875 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25847 SdHoareTripleChecker+Valid, 20409 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:40,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25847 Valid, 20409 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 05:47:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170292 states.