./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:56:17,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:56:17,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:56:17,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:56:17,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:56:17,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:56:17,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:56:17,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:56:17,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:56:17,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:56:17,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:56:17,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:56:17,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:56:17,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:56:17,422 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:56:17,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:56:17,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:56:17,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:56:17,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:56:17,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:17,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:56:17,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2025-03-08 05:56:17,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:56:17,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:56:17,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:56:17,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:56:17,714 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:56:17,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:18,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64801a75c/090fec4443cd4d9fa8bc3aa11efabe0b/FLAGe649f22fb [2025-03-08 05:56:19,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:56:19,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:19,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64801a75c/090fec4443cd4d9fa8bc3aa11efabe0b/FLAGe649f22fb [2025-03-08 05:56:19,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64801a75c/090fec4443cd4d9fa8bc3aa11efabe0b [2025-03-08 05:56:19,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:56:19,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:56:19,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:19,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:56:19,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:56:19,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19, skipping insertion in model container [2025-03-08 05:56:19,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:56:19,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2025-03-08 05:56:19,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:19,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:56:19,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2025-03-08 05:56:19,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:19,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:56:19,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19 WrapperNode [2025-03-08 05:56:19,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:19,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:19,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:56:19,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:56:19,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,642 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 416 [2025-03-08 05:56:19,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:19,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:56:19,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:56:19,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:56:19,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:56:19,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:56:19,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:56:19,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:56:19,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:56:19,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (1/1) ... [2025-03-08 05:56:19,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:19,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:56:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-08 05:56:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-08 05:56:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-08 05:56:19,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-08 05:56:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-08 05:56:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-08 05:56:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-08 05:56:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-08 05:56:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-08 05:56:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-08 05:56:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:56:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:56:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:56:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:56:19,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:56:19,847 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:56:19,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:56:20,262 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-03-08 05:56:20,263 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:56:20,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:56:20,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:56:20,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:20 BoogieIcfgContainer [2025-03-08 05:56:20,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:56:20,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:56:20,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:56:20,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:56:20,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:56:19" (1/3) ... [2025-03-08 05:56:20,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba07b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:20, skipping insertion in model container [2025-03-08 05:56:20,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:19" (2/3) ... [2025-03-08 05:56:20,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba07b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:20, skipping insertion in model container [2025-03-08 05:56:20,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:20" (3/3) ... [2025-03-08 05:56:20,282 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:56:20,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:56:20,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c that has 7 procedures, 176 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:56:20,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:56:20,363 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;@65d3455a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:56:20,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:56:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 136 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:56:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 05:56:20,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:20,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:20,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1088250477, now seen corresponding path program 1 times [2025-03-08 05:56:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974533572] [2025-03-08 05:56:20,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:20,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 05:56:20,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 05:56:20,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:20,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974533572] [2025-03-08 05:56:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974533572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527773833] [2025-03-08 05:56:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:20,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:20,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:20,735 INFO L87 Difference]: Start difference. First operand has 176 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 136 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:56:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:20,841 INFO L93 Difference]: Finished difference Result 352 states and 601 transitions. [2025-03-08 05:56:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 05:56:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:20,851 INFO L225 Difference]: With dead ends: 352 [2025-03-08 05:56:20,852 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 05:56:20,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:20,864 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 7 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:20,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 800 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 05:56:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-08 05:56:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 134 states have (on average 1.5597014925373134) internal successors, (209), 138 states have internal predecessors, (209), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:56:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 283 transitions. [2025-03-08 05:56:20,914 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 283 transitions. Word has length 15 [2025-03-08 05:56:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 283 transitions. [2025-03-08 05:56:20,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:56:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 283 transitions. [2025-03-08 05:56:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 05:56:20,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:20,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:20,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:56:20,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1751837251, now seen corresponding path program 1 times [2025-03-08 05:56:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646694742] [2025-03-08 05:56:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:20,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:20,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:56:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:56:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:20,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:21,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646694742] [2025-03-08 05:56:21,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646694742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:21,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:21,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460885770] [2025-03-08 05:56:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:21,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:21,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:21,028 INFO L87 Difference]: Start difference. First operand 179 states and 283 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:56:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:21,091 INFO L93 Difference]: Finished difference Result 369 states and 587 transitions. [2025-03-08 05:56:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 05:56:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:21,094 INFO L225 Difference]: With dead ends: 369 [2025-03-08 05:56:21,094 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 05:56:21,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:21,096 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:21,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 818 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 05:56:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-08 05:56:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 05:56:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2025-03-08 05:56:21,116 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 16 [2025-03-08 05:56:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2025-03-08 05:56:21,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:56:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2025-03-08 05:56:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:56:21,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:21,118 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:56:21,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1969301919, now seen corresponding path program 1 times [2025-03-08 05:56:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-03-08 05:56:21,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:56:21,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:56:21,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113028275] [2025-03-08 05:56:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113028275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312790823] [2025-03-08 05:56:21,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:21,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:21,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:21,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:21,211 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:21,244 INFO L93 Difference]: Finished difference Result 401 states and 633 transitions. [2025-03-08 05:56:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 05:56:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:21,247 INFO L225 Difference]: With dead ends: 401 [2025-03-08 05:56:21,247 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 05:56:21,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:21,248 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 22 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 548 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-03-08 05:56:21,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 548 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 05:56:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2025-03-08 05:56:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 05:56:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-03-08 05:56:21,273 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 23 [2025-03-08 05:56:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:21,273 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-03-08 05:56:21,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-03-08 05:56:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:56:21,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:21,274 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:56:21,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:56:21,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:21,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -586142999, now seen corresponding path program 1 times [2025-03-08 05:56:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-08 05:56:21,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:56:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:56:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-08 05:56:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248904282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:21,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721376303] [2025-03-08 05:56:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:21,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:21,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:21,408 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:21,455 INFO L93 Difference]: Finished difference Result 377 states and 590 transitions. [2025-03-08 05:56:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-08 05:56:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:21,458 INFO L225 Difference]: With dead ends: 377 [2025-03-08 05:56:21,458 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 05:56:21,459 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-03-08 05:56:21,459 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:21,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 05:56:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-03-08 05:56:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.523489932885906) internal successors, (227), 153 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-08 05:56:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2025-03-08 05:56:21,484 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 32 [2025-03-08 05:56:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:21,484 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2025-03-08 05:56:21,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2025-03-08 05:56:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:56:21,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:21,485 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:56:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:56:21,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:21,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1592030103, now seen corresponding path program 1 times [2025-03-08 05:56:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-03-08 05:56:21,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:21,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:56:21,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:56:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-03-08 05:56:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473376739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:21,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612216284] [2025-03-08 05:56:21,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:21,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:21,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:21,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:56:21,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:56:21,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:56:21,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:21,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612216284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:21,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 05:56:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920191638] [2025-03-08 05:56:21,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:21,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:21,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:21,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:21,724 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:56:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:21,782 INFO L93 Difference]: Finished difference Result 442 states and 696 transitions. [2025-03-08 05:56:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:21,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-03-08 05:56:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:21,785 INFO L225 Difference]: With dead ends: 442 [2025-03-08 05:56:21,785 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 05:56:21,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:21,786 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 91 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:21,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 591 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:21,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 05:56:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2025-03-08 05:56:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 192 states have (on average 1.5) internal successors, (288), 196 states have internal predecessors, (288), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-03-08 05:56:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2025-03-08 05:56:21,816 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 34 [2025-03-08 05:56:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2025-03-08 05:56:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:56:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2025-03-08 05:56:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 05:56:21,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:21,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:21,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:56:22,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:22,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1861246826, now seen corresponding path program 1 times [2025-03-08 05:56:22,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759419739] [2025-03-08 05:56:22,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 05:56:22,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 05:56:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759419739] [2025-03-08 05:56:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759419739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:22,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50657869] [2025-03-08 05:56:22,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:22,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:22,120 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:56:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,185 INFO L93 Difference]: Finished difference Result 394 states and 613 transitions. [2025-03-08 05:56:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:56:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-08 05:56:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,188 INFO L225 Difference]: With dead ends: 394 [2025-03-08 05:56:22,189 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 05:56:22,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:22,191 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 05:56:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-08 05:56:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.470899470899471) internal successors, (278), 193 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 05:56:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2025-03-08 05:56:22,207 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 35 [2025-03-08 05:56:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2025-03-08 05:56:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:56:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2025-03-08 05:56:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:22,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,211 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:22,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:56:22,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash -734314135, now seen corresponding path program 2 times [2025-03-08 05:56:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315478353] [2025-03-08 05:56:22,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:56:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 05:56:22,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-03-08 05:56:22,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:56:22,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:56:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315478353] [2025-03-08 05:56:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315478353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420180700] [2025-03-08 05:56:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:22,261 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,322 INFO L93 Difference]: Finished difference Result 462 states and 727 transitions. [2025-03-08 05:56:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-08 05:56:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,325 INFO L225 Difference]: With dead ends: 462 [2025-03-08 05:56:22,326 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 05:56:22,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:22,328 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 7 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 753 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 05:56:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-08 05:56:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 192 states have internal predecessors, (276), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 05:56:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 370 transitions. [2025-03-08 05:56:22,341 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 370 transitions. Word has length 56 [2025-03-08 05:56:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 370 transitions. [2025-03-08 05:56:22,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 370 transitions. [2025-03-08 05:56:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:22,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,343 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:22,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:56:22,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1795771519, now seen corresponding path program 1 times [2025-03-08 05:56:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987237841] [2025-03-08 05:56:22,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:56:22,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:56:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:56:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987237841] [2025-03-08 05:56:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987237841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162308584] [2025-03-08 05:56:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:22,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:22,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:22,453 INFO L87 Difference]: Start difference. First operand 244 states and 370 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,500 INFO L93 Difference]: Finished difference Result 467 states and 725 transitions. [2025-03-08 05:56:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-08 05:56:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,503 INFO L225 Difference]: With dead ends: 467 [2025-03-08 05:56:22,504 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 05:56:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:22,505 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 8 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 778 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 05:56:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-08 05:56:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 198 states have internal predecessors, (284), 47 states have call successors, (47), 9 states have call predecessors, (47), 9 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 05:56:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 378 transitions. [2025-03-08 05:56:22,520 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 378 transitions. Word has length 56 [2025-03-08 05:56:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 378 transitions. [2025-03-08 05:56:22,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 378 transitions. [2025-03-08 05:56:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:56:22,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:22,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:56:22,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1592290681, now seen corresponding path program 1 times [2025-03-08 05:56:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670813345] [2025-03-08 05:56:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:56:22,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:56:22,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:56:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670813345] [2025-03-08 05:56:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670813345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724921554] [2025-03-08 05:56:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:22,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:22,606 INFO L87 Difference]: Start difference. First operand 251 states and 378 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,641 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2025-03-08 05:56:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-08 05:56:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,643 INFO L225 Difference]: With dead ends: 511 [2025-03-08 05:56:22,643 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 05:56:22,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:22,645 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 22 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 793 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 05:56:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2025-03-08 05:56:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 229 states have internal predecessors, (320), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 05:56:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2025-03-08 05:56:22,655 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 57 [2025-03-08 05:56:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,655 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2025-03-08 05:56:22,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:56:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2025-03-08 05:56:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:56:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,656 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:56:22,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:56:22,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 610717128, now seen corresponding path program 1 times [2025-03-08 05:56:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-03-08 05:56:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:56:22,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:56:22,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-03-08 05:56:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060324069] [2025-03-08 05:56:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:22,759 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,788 INFO L93 Difference]: Finished difference Result 523 states and 781 transitions. [2025-03-08 05:56:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:22,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-03-08 05:56:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,790 INFO L225 Difference]: With dead ends: 523 [2025-03-08 05:56:22,790 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 05:56:22,791 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-03-08 05:56:22,792 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 05:56:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2025-03-08 05:56:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 225 states have (on average 1.4088888888888889) internal successors, (317), 229 states have internal predecessors, (317), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 05:56:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 417 transitions. [2025-03-08 05:56:22,805 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 417 transitions. Word has length 75 [2025-03-08 05:56:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,805 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 417 transitions. [2025-03-08 05:56:22,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 417 transitions. [2025-03-08 05:56:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:56:22,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,807 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:22,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:56:22,807 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -764366104, now seen corresponding path program 1 times [2025-03-08 05:56:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998900072] [2025-03-08 05:56:22,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:56:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:56:22,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-08 05:56:22,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:22,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998900072] [2025-03-08 05:56:22,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998900072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:22,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201455246] [2025-03-08 05:56:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:22,896 INFO L87 Difference]: Start difference. First operand 286 states and 417 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:22,933 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2025-03-08 05:56:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:22,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-03-08 05:56:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:22,936 INFO L225 Difference]: With dead ends: 510 [2025-03-08 05:56:22,936 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 05:56:22,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:22,938 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:22,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 761 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 05:56:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-08 05:56:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 220 states have (on average 1.3863636363636365) internal successors, (305), 224 states have internal predecessors, (305), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 05:56:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 403 transitions. [2025-03-08 05:56:22,949 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 403 transitions. Word has length 103 [2025-03-08 05:56:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:22,951 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 403 transitions. [2025-03-08 05:56:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 403 transitions. [2025-03-08 05:56:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:56:22,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:22,953 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:56:22,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:56:22,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:22,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -353924808, now seen corresponding path program 1 times [2025-03-08 05:56:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628922048] [2025-03-08 05:56:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:56:22,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:56:22,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:22,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-08 05:56:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628922048] [2025-03-08 05:56:23,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628922048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264184095] [2025-03-08 05:56:23,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:23,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:23,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:23,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:23,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:56:23,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:56:23,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:56:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:23,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:23,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:56:23,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264184095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:23,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 05:56:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776009858] [2025-03-08 05:56:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:23,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:23,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:23,231 INFO L87 Difference]: Start difference. First operand 280 states and 403 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:23,280 INFO L93 Difference]: Finished difference Result 506 states and 744 transitions. [2025-03-08 05:56:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 137 [2025-03-08 05:56:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:23,282 INFO L225 Difference]: With dead ends: 506 [2025-03-08 05:56:23,282 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 05:56:23,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:23,283 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 32 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 718 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 05:56:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-08 05:56:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 210 states have internal predecessors, (284), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:56:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 376 transitions. [2025-03-08 05:56:23,293 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 376 transitions. Word has length 137 [2025-03-08 05:56:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 376 transitions. [2025-03-08 05:56:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 376 transitions. [2025-03-08 05:56:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:56:23,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:23,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:56:23,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 05:56:23,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1540338194, now seen corresponding path program 1 times [2025-03-08 05:56:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:23,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142715481] [2025-03-08 05:56:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:56:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:56:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-03-08 05:56:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142715481] [2025-03-08 05:56:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142715481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815479497] [2025-03-08 05:56:23,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:23,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:23,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:56:23,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:56:23,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:56:23,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:23,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:23,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-03-08 05:56:23,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815479497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:23,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 05:56:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509225115] [2025-03-08 05:56:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:23,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:23,739 INFO L87 Difference]: Start difference. First operand 263 states and 376 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:23,790 INFO L93 Difference]: Finished difference Result 472 states and 690 transitions. [2025-03-08 05:56:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:23,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2025-03-08 05:56:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:23,792 INFO L225 Difference]: With dead ends: 472 [2025-03-08 05:56:23,792 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 05:56:23,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:23,794 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 34 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:23,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 714 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 05:56:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-03-08 05:56:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 194 states have internal predecessors, (261), 43 states have call successors, (43), 10 states have call predecessors, (43), 10 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 05:56:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2025-03-08 05:56:23,804 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 141 [2025-03-08 05:56:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:23,804 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2025-03-08 05:56:23,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2025-03-08 05:56:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:56:23,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:23,806 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:56:23,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:56:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:24,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash 270179104, now seen corresponding path program 1 times [2025-03-08 05:56:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781918527] [2025-03-08 05:56:24,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:24,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:56:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:56:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-08 05:56:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781918527] [2025-03-08 05:56:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781918527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873480391] [2025-03-08 05:56:24,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:24,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:24,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:24,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:56:24,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:56:24,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:56:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:24,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:24,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 05:56:24,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873480391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 05:56:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645571304] [2025-03-08 05:56:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:24,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:24,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:24,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:24,258 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:24,325 INFO L93 Difference]: Finished difference Result 463 states and 673 transitions. [2025-03-08 05:56:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2025-03-08 05:56:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:24,328 INFO L225 Difference]: With dead ends: 463 [2025-03-08 05:56:24,328 INFO L226 Difference]: Without dead ends: 275 [2025-03-08 05:56:24,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:24,329 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 31 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:24,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 726 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-08 05:56:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-08 05:56:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 217 states have (on average 1.3732718894009217) internal successors, (298), 221 states have internal predecessors, (298), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:56:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2025-03-08 05:56:24,343 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 390 transitions. Word has length 144 [2025-03-08 05:56:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:24,343 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 390 transitions. [2025-03-08 05:56:24,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:56:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 390 transitions. [2025-03-08 05:56:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:56:24,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:24,345 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:56:24,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:56:24,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:24,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:24,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash 208628424, now seen corresponding path program 2 times [2025-03-08 05:56:24,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:24,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546274855] [2025-03-08 05:56:24,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:56:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:24,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-08 05:56:24,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 144 statements. [2025-03-08 05:56:24,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:56:24,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 05:56:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546274855] [2025-03-08 05:56:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546274855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545233329] [2025-03-08 05:56:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:24,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:24,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:24,600 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 05:56:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:24,628 INFO L93 Difference]: Finished difference Result 419 states and 609 transitions. [2025-03-08 05:56:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:24,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 144 [2025-03-08 05:56:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:24,631 INFO L225 Difference]: With dead ends: 419 [2025-03-08 05:56:24,631 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 05:56:24,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:24,633 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:24,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 770 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 05:56:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-08 05:56:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 220 states have (on average 1.3681818181818182) internal successors, (301), 224 states have internal predecessors, (301), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:56:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 393 transitions. [2025-03-08 05:56:24,646 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 393 transitions. Word has length 144 [2025-03-08 05:56:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:24,646 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 393 transitions. [2025-03-08 05:56:24,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 05:56:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 393 transitions. [2025-03-08 05:56:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 05:56:24,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:24,648 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:24,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:56:24,648 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:24,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1707560964, now seen corresponding path program 1 times [2025-03-08 05:56:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276867985] [2025-03-08 05:56:24,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:24,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:56:24,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:56:24,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 05:56:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:24,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276867985] [2025-03-08 05:56:24,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276867985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:24,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880832281] [2025-03-08 05:56:24,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:24,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:24,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:24,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:24,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:56:24,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:56:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:56:24,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:24,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:24,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:24,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 05:56:24,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880832281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 05:56:24,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997103571] [2025-03-08 05:56:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:24,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:24,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:24,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:24,938 INFO L87 Difference]: Start difference. First operand 279 states and 393 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:56:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:24,975 INFO L93 Difference]: Finished difference Result 428 states and 617 transitions. [2025-03-08 05:56:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:24,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 151 [2025-03-08 05:56:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:24,978 INFO L225 Difference]: With dead ends: 428 [2025-03-08 05:56:24,978 INFO L226 Difference]: Without dead ends: 284 [2025-03-08 05:56:24,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:24,979 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:24,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 772 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-08 05:56:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-08 05:56:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 224 states have (on average 1.3616071428571428) internal successors, (305), 228 states have internal predecessors, (305), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:56:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 397 transitions. [2025-03-08 05:56:24,994 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 397 transitions. Word has length 151 [2025-03-08 05:56:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 397 transitions. [2025-03-08 05:56:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:56:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 397 transitions. [2025-03-08 05:56:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:56:24,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:24,996 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03-08 05:56:25,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:56:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:56:25,197 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1662482703, now seen corresponding path program 1 times [2025-03-08 05:56:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519729400] [2025-03-08 05:56:25,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:56:25,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:56:25,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:25,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 05:56:25,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519729400] [2025-03-08 05:56:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519729400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143651832] [2025-03-08 05:56:25,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:25,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:25,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:25,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:56:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:56:25,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:56:25,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:25,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:25,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 05:56:25,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143651832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 05:56:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703464207] [2025-03-08 05:56:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:25,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:25,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:25,482 INFO L87 Difference]: Start difference. First operand 284 states and 397 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:56:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:25,512 INFO L93 Difference]: Finished difference Result 432 states and 617 transitions. [2025-03-08 05:56:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:25,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 159 [2025-03-08 05:56:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:25,515 INFO L225 Difference]: With dead ends: 432 [2025-03-08 05:56:25,515 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 05:56:25,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:25,516 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 5 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:25,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 762 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 05:56:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-08 05:56:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 227 states have internal predecessors, (302), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 05:56:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 392 transitions. [2025-03-08 05:56:25,526 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 392 transitions. Word has length 159 [2025-03-08 05:56:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 392 transitions. [2025-03-08 05:56:25,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:56:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 392 transitions. [2025-03-08 05:56:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:56:25,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:25,528 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:25,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:56:25,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:56:25,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:25,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1304727926, now seen corresponding path program 1 times [2025-03-08 05:56:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20157354] [2025-03-08 05:56:25,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:56:25,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:56:25,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:25,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 05:56:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20157354] [2025-03-08 05:56:25,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20157354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588632509] [2025-03-08 05:56:25,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:25,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:25,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:25,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:25,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:56:25,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:56:25,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:56:25,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:25,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:26,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-08 05:56:26,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588632509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:56:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030643203] [2025-03-08 05:56:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:26,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:26,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:26,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:26,016 INFO L87 Difference]: Start difference. First operand 283 states and 392 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:56:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:26,026 INFO L93 Difference]: Finished difference Result 430 states and 606 transitions. [2025-03-08 05:56:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 166 [2025-03-08 05:56:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:26,028 INFO L225 Difference]: With dead ends: 430 [2025-03-08 05:56:26,028 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 05:56:26,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:26,029 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:26,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 05:56:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-08 05:56:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.34375) internal successors, (301), 226 states have internal predecessors, (301), 44 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 05:56:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 389 transitions. [2025-03-08 05:56:26,039 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 389 transitions. Word has length 166 [2025-03-08 05:56:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:26,040 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 389 transitions. [2025-03-08 05:56:26,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:56:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 389 transitions. [2025-03-08 05:56:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:56:26,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:26,041 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:26,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:56:26,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:26,242 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash -902346866, now seen corresponding path program 1 times [2025-03-08 05:56:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105390323] [2025-03-08 05:56:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:26,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:56:26,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:56:26,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 05:56:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105390323] [2025-03-08 05:56:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105390323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209695699] [2025-03-08 05:56:26,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:26,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:26,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:26,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:56:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:56:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:56:26,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:26,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:56:26,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-08 05:56:26,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209695699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:26,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:26,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 05:56:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796608806] [2025-03-08 05:56:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:26,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:26,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:26,548 INFO L87 Difference]: Start difference. First operand 282 states and 389 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:56:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:26,613 INFO L93 Difference]: Finished difference Result 642 states and 887 transitions. [2025-03-08 05:56:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:26,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 169 [2025-03-08 05:56:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:26,616 INFO L225 Difference]: With dead ends: 642 [2025-03-08 05:56:26,617 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 05:56:26,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:26,618 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:26,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 725 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 05:56:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 489. [2025-03-08 05:56:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.359375) internal successors, (522), 386 states have internal predecessors, (522), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:56:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 668 transitions. [2025-03-08 05:56:26,637 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 668 transitions. Word has length 169 [2025-03-08 05:56:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:26,638 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 668 transitions. [2025-03-08 05:56:26,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:56:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 668 transitions. [2025-03-08 05:56:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 05:56:26,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:26,642 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:26,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:56:26,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:26,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:26,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash -613988335, now seen corresponding path program 1 times [2025-03-08 05:56:26,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:26,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185295750] [2025-03-08 05:56:26,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:26,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 05:56:26,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 05:56:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185295750] [2025-03-08 05:56:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185295750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066638660] [2025-03-08 05:56:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:26,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:26,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:56:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 05:56:27,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 05:56:27,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:27,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:27,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 05:56:27,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066638660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 05:56:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296651378] [2025-03-08 05:56:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:27,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:27,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:27,147 INFO L87 Difference]: Start difference. First operand 489 states and 668 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:27,215 INFO L93 Difference]: Finished difference Result 783 states and 1088 transitions. [2025-03-08 05:56:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 200 [2025-03-08 05:56:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:27,220 INFO L225 Difference]: With dead ends: 783 [2025-03-08 05:56:27,220 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:56:27,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:27,222 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 31 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 697 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:56:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:56:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.34375) internal successors, (516), 386 states have internal predecessors, (516), 73 states have call successors, (73), 31 states have call predecessors, (73), 31 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:56:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 662 transitions. [2025-03-08 05:56:27,238 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 662 transitions. Word has length 200 [2025-03-08 05:56:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:27,238 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 662 transitions. [2025-03-08 05:56:27,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 662 transitions. [2025-03-08 05:56:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 05:56:27,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:27,240 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:27,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:56:27,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:27,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:27,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 108016224, now seen corresponding path program 1 times [2025-03-08 05:56:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104842402] [2025-03-08 05:56:27,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:27,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:56:27,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:56:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:27,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104842402] [2025-03-08 05:56:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104842402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674805847] [2025-03-08 05:56:27,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:27,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:27,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:27,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:56:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 05:56:27,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 05:56:27,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:27,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:27,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:56:27,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 05:56:27,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674805847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:27,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 05:56:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448293655] [2025-03-08 05:56:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:27,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:27,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:27,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:27,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:27,772 INFO L87 Difference]: Start difference. First operand 489 states and 662 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:27,834 INFO L93 Difference]: Finished difference Result 783 states and 1074 transitions. [2025-03-08 05:56:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 201 [2025-03-08 05:56:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:27,838 INFO L225 Difference]: With dead ends: 783 [2025-03-08 05:56:27,838 INFO L226 Difference]: Without dead ends: 501 [2025-03-08 05:56:27,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:27,840 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 7 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:27,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 705 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-08 05:56:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-03-08 05:56:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 396 states have internal predecessors, (530), 73 states have call successors, (73), 33 states have call predecessors, (73), 33 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:56:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 676 transitions. [2025-03-08 05:56:27,858 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 676 transitions. Word has length 201 [2025-03-08 05:56:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:27,859 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 676 transitions. [2025-03-08 05:56:27,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 676 transitions. [2025-03-08 05:56:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 05:56:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:27,862 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:27,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:56:28,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 05:56:28,063 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:28,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:28,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1875704519, now seen corresponding path program 1 times [2025-03-08 05:56:28,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:28,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91003803] [2025-03-08 05:56:28,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:28,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 05:56:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 05:56:28,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:28,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91003803] [2025-03-08 05:56:28,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91003803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963431835] [2025-03-08 05:56:28,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:28,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:28,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:28,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:28,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:56:28,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 05:56:28,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 05:56:28,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:28,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:28,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:56:28,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-08 05:56:28,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963431835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:56:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853030397] [2025-03-08 05:56:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:28,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:28,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:28,420 INFO L87 Difference]: Start difference. First operand 501 states and 676 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:56:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:28,469 INFO L93 Difference]: Finished difference Result 1096 states and 1498 transitions. [2025-03-08 05:56:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 202 [2025-03-08 05:56:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:28,475 INFO L225 Difference]: With dead ends: 1096 [2025-03-08 05:56:28,475 INFO L226 Difference]: Without dead ends: 802 [2025-03-08 05:56:28,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:28,479 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 164 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:28,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 528 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-08 05:56:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 621. [2025-03-08 05:56:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 489 states have (on average 1.3456032719836402) internal successors, (658), 495 states have internal predecessors, (658), 88 states have call successors, (88), 43 states have call predecessors, (88), 43 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 05:56:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 834 transitions. [2025-03-08 05:56:28,519 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 834 transitions. Word has length 202 [2025-03-08 05:56:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:28,519 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 834 transitions. [2025-03-08 05:56:28,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:56:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 834 transitions. [2025-03-08 05:56:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 05:56:28,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:28,523 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:28,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:56:28,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 05:56:28,728 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 752615599, now seen corresponding path program 1 times [2025-03-08 05:56:28,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138024678] [2025-03-08 05:56:28,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:56:28,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:56:28,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:28,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138024678] [2025-03-08 05:56:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138024678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109860008] [2025-03-08 05:56:28,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:28,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:56:28,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 05:56:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 05:56:28,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:28,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:28,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:56:28,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-08 05:56:29,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109860008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:56:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890470920] [2025-03-08 05:56:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:29,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:29,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:29,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:29,035 INFO L87 Difference]: Start difference. First operand 621 states and 834 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:56:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:29,095 INFO L93 Difference]: Finished difference Result 1373 states and 1862 transitions. [2025-03-08 05:56:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 203 [2025-03-08 05:56:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:29,101 INFO L225 Difference]: With dead ends: 1373 [2025-03-08 05:56:29,101 INFO L226 Difference]: Without dead ends: 992 [2025-03-08 05:56:29,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:29,103 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 168 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:29,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 544 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-08 05:56:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 984. [2025-03-08 05:56:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 770 states have (on average 1.3545454545454545) internal successors, (1043), 784 states have internal predecessors, (1043), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 132 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-08 05:56:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1327 transitions. [2025-03-08 05:56:29,141 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1327 transitions. Word has length 203 [2025-03-08 05:56:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:29,142 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1327 transitions. [2025-03-08 05:56:29,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:56:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1327 transitions. [2025-03-08 05:56:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:56:29,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:29,144 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:29,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 05:56:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 05:56:29,345 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:29,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash -520198684, now seen corresponding path program 1 times [2025-03-08 05:56:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305857543] [2025-03-08 05:56:29,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:29,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:56:29,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:56:29,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:29,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305857543] [2025-03-08 05:56:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305857543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998477856] [2025-03-08 05:56:29,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:29,428 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:29,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:56:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:56:29,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:56:29,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:29,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:56:29,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-08 05:56:29,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998477856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:56:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18163820] [2025-03-08 05:56:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:29,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:29,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:29,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:29,604 INFO L87 Difference]: Start difference. First operand 984 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:29,682 INFO L93 Difference]: Finished difference Result 2300 states and 3137 transitions. [2025-03-08 05:56:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 204 [2025-03-08 05:56:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:29,689 INFO L225 Difference]: With dead ends: 2300 [2025-03-08 05:56:29,689 INFO L226 Difference]: Without dead ends: 1596 [2025-03-08 05:56:29,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:29,692 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 175 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:29,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 561 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-03-08 05:56:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1582. [2025-03-08 05:56:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1232 states have (on average 1.3660714285714286) internal successors, (1683), 1260 states have internal predecessors, (1683), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-08 05:56:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2151 transitions. [2025-03-08 05:56:29,756 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2151 transitions. Word has length 204 [2025-03-08 05:56:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:29,756 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2151 transitions. [2025-03-08 05:56:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2151 transitions. [2025-03-08 05:56:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 05:56:29,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:29,759 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:29,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 05:56:29,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 05:56:29,960 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1112605315, now seen corresponding path program 1 times [2025-03-08 05:56:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528517985] [2025-03-08 05:56:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:29,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:56:29,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:56:29,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:29,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 05:56:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528517985] [2025-03-08 05:56:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528517985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098929559] [2025-03-08 05:56:30,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:30,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:30,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:30,044 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:30,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:56:30,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 05:56:30,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 05:56:30,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:30,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:30,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:56:30,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-08 05:56:30,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098929559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:30,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-08 05:56:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657098950] [2025-03-08 05:56:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:30,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:30,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:30,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:30,218 INFO L87 Difference]: Start difference. First operand 1582 states and 2151 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:30,285 INFO L93 Difference]: Finished difference Result 3011 states and 4105 transitions. [2025-03-08 05:56:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 204 [2025-03-08 05:56:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:30,294 INFO L225 Difference]: With dead ends: 3011 [2025-03-08 05:56:30,294 INFO L226 Difference]: Without dead ends: 1584 [2025-03-08 05:56:30,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:30,297 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:30,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1015 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-08 05:56:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1582. [2025-03-08 05:56:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1232 states have (on average 1.3612012987012987) internal successors, (1677), 1260 states have internal predecessors, (1677), 234 states have call successors, (234), 115 states have call predecessors, (234), 115 states have return successors, (234), 214 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-08 05:56:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2145 transitions. [2025-03-08 05:56:30,363 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2145 transitions. Word has length 204 [2025-03-08 05:56:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:30,365 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2145 transitions. [2025-03-08 05:56:30,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2145 transitions. [2025-03-08 05:56:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 05:56:30,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:30,367 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:30,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:30,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:30,568 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:30,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -319454510, now seen corresponding path program 1 times [2025-03-08 05:56:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:30,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533982514] [2025-03-08 05:56:30,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 05:56:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 05:56:30,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-08 05:56:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:30,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533982514] [2025-03-08 05:56:30,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533982514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:30,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85739885] [2025-03-08 05:56:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:30,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:30,652 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:30,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:56:30,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 05:56:30,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 05:56:30,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:30,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:30,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:30,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 127 proven. 11 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-08 05:56:30,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-08 05:56:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85739885] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:56:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2025-03-08 05:56:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268988122] [2025-03-08 05:56:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:30,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:30,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:30,978 INFO L87 Difference]: Start difference. First operand 1582 states and 2145 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:56:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:31,062 INFO L93 Difference]: Finished difference Result 3032 states and 4128 transitions. [2025-03-08 05:56:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 210 [2025-03-08 05:56:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:31,070 INFO L225 Difference]: With dead ends: 3032 [2025-03-08 05:56:31,070 INFO L226 Difference]: Without dead ends: 1573 [2025-03-08 05:56:31,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:31,074 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:31,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 477 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-08 05:56:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-08 05:56:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1226 states have (on average 1.3556280587275693) internal successors, (1662), 1254 states have internal predecessors, (1662), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-08 05:56:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2124 transitions. [2025-03-08 05:56:31,133 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2124 transitions. Word has length 210 [2025-03-08 05:56:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:31,133 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2124 transitions. [2025-03-08 05:56:31,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:56:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2124 transitions. [2025-03-08 05:56:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 05:56:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:31,135 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:31,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 05:56:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 05:56:31,337 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:31,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1105296871, now seen corresponding path program 1 times [2025-03-08 05:56:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955780915] [2025-03-08 05:56:31,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:31,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 05:56:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 05:56:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-08 05:56:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955780915] [2025-03-08 05:56:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955780915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982463206] [2025-03-08 05:56:31,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:31,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:31,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:31,430 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:31,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:56:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 05:56:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 05:56:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:31,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:56:31,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-08 05:56:31,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:31,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982463206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:31,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-08 05:56:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358895927] [2025-03-08 05:56:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:31,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:31,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:31,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:31,614 INFO L87 Difference]: Start difference. First operand 1573 states and 2124 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:31,661 INFO L93 Difference]: Finished difference Result 3040 states and 4121 transitions. [2025-03-08 05:56:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 234 [2025-03-08 05:56:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:31,669 INFO L225 Difference]: With dead ends: 3040 [2025-03-08 05:56:31,669 INFO L226 Difference]: Without dead ends: 1573 [2025-03-08 05:56:31,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 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-03-08 05:56:31,672 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:31,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-08 05:56:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-08 05:56:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1226 states have (on average 1.3531810766721044) internal successors, (1659), 1254 states have internal predecessors, (1659), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-08 05:56:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2121 transitions. [2025-03-08 05:56:31,730 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2121 transitions. Word has length 234 [2025-03-08 05:56:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:31,731 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2121 transitions. [2025-03-08 05:56:31,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:56:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2121 transitions. [2025-03-08 05:56:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-08 05:56:31,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:31,734 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:31,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 05:56:31,935 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash 861610560, now seen corresponding path program 1 times [2025-03-08 05:56:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089443792] [2025-03-08 05:56:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:31,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:56:31,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:56:31,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 81 proven. 72 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-08 05:56:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089443792] [2025-03-08 05:56:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089443792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206379159] [2025-03-08 05:56:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:32,006 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:32,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:56:32,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:56:32,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:56:32,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:32,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:32,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:32,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 255 proven. 9 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-08 05:56:32,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 90 proven. 63 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-08 05:56:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206379159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:32,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 05:56:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965460502] [2025-03-08 05:56:32,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:32,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:32,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:32,332 INFO L87 Difference]: Start difference. First operand 1573 states and 2121 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:56:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:32,399 INFO L93 Difference]: Finished difference Result 3076 states and 4162 transitions. [2025-03-08 05:56:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:32,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 239 [2025-03-08 05:56:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:32,407 INFO L225 Difference]: With dead ends: 3076 [2025-03-08 05:56:32,407 INFO L226 Difference]: Without dead ends: 1570 [2025-03-08 05:56:32,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:32,412 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 45 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:32,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 468 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-08 05:56:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-03-08 05:56:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1223 states have (on average 1.3515944399018807) internal successors, (1653), 1251 states have internal predecessors, (1653), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-08 05:56:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2115 transitions. [2025-03-08 05:56:32,472 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2115 transitions. Word has length 239 [2025-03-08 05:56:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:32,473 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2115 transitions. [2025-03-08 05:56:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:56:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2115 transitions. [2025-03-08 05:56:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 05:56:32,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:32,475 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:32,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 05:56:32,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 05:56:32,676 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:32,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 359444327, now seen corresponding path program 1 times [2025-03-08 05:56:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010813588] [2025-03-08 05:56:32,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:32,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 05:56:32,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 05:56:32,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-08 05:56:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010813588] [2025-03-08 05:56:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010813588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488697190] [2025-03-08 05:56:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:33,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:33,007 INFO L87 Difference]: Start difference. First operand 1570 states and 2115 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 05:56:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:33,101 INFO L93 Difference]: Finished difference Result 2400 states and 3462 transitions. [2025-03-08 05:56:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:56:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 266 [2025-03-08 05:56:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:33,113 INFO L225 Difference]: With dead ends: 2400 [2025-03-08 05:56:33,113 INFO L226 Difference]: Without dead ends: 2398 [2025-03-08 05:56:33,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:33,114 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 116 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:33,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1779 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-08 05:56:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 1618. [2025-03-08 05:56:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1255 states have (on average 1.342629482071713) internal successors, (1685), 1291 states have internal predecessors, (1685), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-08 05:56:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2163 transitions. [2025-03-08 05:56:33,224 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2163 transitions. Word has length 266 [2025-03-08 05:56:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:33,225 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2163 transitions. [2025-03-08 05:56:33,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 05:56:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2163 transitions. [2025-03-08 05:56:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-08 05:56:33,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:33,228 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 05:56:33,229 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash 666373643, now seen corresponding path program 1 times [2025-03-08 05:56:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308463280] [2025-03-08 05:56:33,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:33,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 05:56:33,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 05:56:33,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:33,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-08 05:56:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308463280] [2025-03-08 05:56:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308463280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828278020] [2025-03-08 05:56:33,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:33,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:33,525 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:56:33,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 05:56:33,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 05:56:33,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:33,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:33,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:56:33,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-08 05:56:33,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-08 05:56:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828278020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:34,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:34,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-08 05:56:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530232759] [2025-03-08 05:56:34,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:56:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:34,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:56:34,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:34,174 INFO L87 Difference]: Start difference. First operand 1618 states and 2163 transitions. Second operand has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-08 05:56:34,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:34,667 INFO L93 Difference]: Finished difference Result 3973 states and 5499 transitions. [2025-03-08 05:56:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:56:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 274 [2025-03-08 05:56:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:34,682 INFO L225 Difference]: With dead ends: 3973 [2025-03-08 05:56:34,682 INFO L226 Difference]: Without dead ends: 2631 [2025-03-08 05:56:34,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 539 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:56:34,689 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 219 mSDsluCounter, 4481 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 4834 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:34,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 4834 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:56:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2025-03-08 05:56:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2403. [2025-03-08 05:56:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1857 states have (on average 1.3295638126009692) internal successors, (2469), 1909 states have internal predecessors, (2469), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-03-08 05:56:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 3189 transitions. [2025-03-08 05:56:34,828 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 3189 transitions. Word has length 274 [2025-03-08 05:56:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:34,829 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 3189 transitions. [2025-03-08 05:56:34,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 14 states have internal predecessors, (148), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-08 05:56:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 3189 transitions. [2025-03-08 05:56:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-08 05:56:34,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:34,833 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:34,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 05:56:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:35,033 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:35,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1627987660, now seen corresponding path program 1 times [2025-03-08 05:56:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21911729] [2025-03-08 05:56:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 05:56:35,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 05:56:35,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:35,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-08 05:56:35,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21911729] [2025-03-08 05:56:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21911729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459385691] [2025-03-08 05:56:35,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:35,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:35,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:35,129 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:35,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 05:56:35,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 05:56:35,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 05:56:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:35,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:35,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-08 05:56:35,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459385691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:35,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 05:56:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957688157] [2025-03-08 05:56:35,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:35,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:35,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:35,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:35,324 INFO L87 Difference]: Start difference. First operand 2403 states and 3189 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:56:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:35,430 INFO L93 Difference]: Finished difference Result 4642 states and 6257 transitions. [2025-03-08 05:56:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 274 [2025-03-08 05:56:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:35,442 INFO L225 Difference]: With dead ends: 4642 [2025-03-08 05:56:35,443 INFO L226 Difference]: Without dead ends: 2339 [2025-03-08 05:56:35,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:35,449 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:35,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 696 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-03-08 05:56:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2339. [2025-03-08 05:56:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1813 states have (on average 1.3121897407611693) internal successors, (2379), 1865 states have internal predecessors, (2379), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-03-08 05:56:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3063 transitions. [2025-03-08 05:56:35,569 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3063 transitions. Word has length 274 [2025-03-08 05:56:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:35,569 INFO L471 AbstractCegarLoop]: Abstraction has 2339 states and 3063 transitions. [2025-03-08 05:56:35,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:56:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3063 transitions. [2025-03-08 05:56:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 05:56:35,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:35,572 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:35,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:35,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:35,773 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1411264077, now seen corresponding path program 1 times [2025-03-08 05:56:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150525926] [2025-03-08 05:56:35,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:35,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 05:56:35,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 05:56:35,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:35,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-08 05:56:35,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:35,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150525926] [2025-03-08 05:56:35,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150525926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:35,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215772218] [2025-03-08 05:56:35,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:35,867 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:35,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 05:56:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 05:56:36,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 05:56:36,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:36,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:36,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:56:36,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-08 05:56:36,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215772218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:36,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 05:56:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768480672] [2025-03-08 05:56:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:36,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:36,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:36,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:36,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:36,048 INFO L87 Difference]: Start difference. First operand 2339 states and 3063 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:56:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:36,162 INFO L93 Difference]: Finished difference Result 4425 states and 5899 transitions. [2025-03-08 05:56:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 277 [2025-03-08 05:56:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:36,177 INFO L225 Difference]: With dead ends: 4425 [2025-03-08 05:56:36,177 INFO L226 Difference]: Without dead ends: 2168 [2025-03-08 05:56:36,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:36,183 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:36,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 724 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2025-03-08 05:56:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2025-03-08 05:56:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1672 states have (on average 1.305622009569378) internal successors, (2183), 1724 states have internal predecessors, (2183), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-03-08 05:56:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2829 transitions. [2025-03-08 05:56:36,300 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2829 transitions. Word has length 277 [2025-03-08 05:56:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:36,300 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2829 transitions. [2025-03-08 05:56:36,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:56:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2829 transitions. [2025-03-08 05:56:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-08 05:56:36,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:36,304 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:36,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 05:56:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-08 05:56:36,504 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -567054705, now seen corresponding path program 1 times [2025-03-08 05:56:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710789933] [2025-03-08 05:56:36,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:36,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-08 05:56:36,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-08 05:56:36,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:36,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 24 proven. 141 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-08 05:56:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710789933] [2025-03-08 05:56:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710789933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976148093] [2025-03-08 05:56:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:37,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:37,609 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:37,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 05:56:37,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-08 05:56:37,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-08 05:56:37,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:37,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:37,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:56:37,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-08 05:56:37,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976148093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2025-03-08 05:56:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815701036] [2025-03-08 05:56:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:37,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:56:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:37,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:56:37,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:56:37,925 INFO L87 Difference]: Start difference. First operand 2168 states and 2829 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:56:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:38,211 INFO L93 Difference]: Finished difference Result 4798 states and 6268 transitions. [2025-03-08 05:56:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 289 [2025-03-08 05:56:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:38,223 INFO L225 Difference]: With dead ends: 4798 [2025-03-08 05:56:38,223 INFO L226 Difference]: Without dead ends: 3192 [2025-03-08 05:56:38,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:56:38,229 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 128 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:38,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1879 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2025-03-08 05:56:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3178. [2025-03-08 05:56:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3178 states, 2443 states have (on average 1.2988129349160868) internal successors, (3173), 2523 states have internal predecessors, (3173), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2025-03-08 05:56:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4107 transitions. [2025-03-08 05:56:38,356 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4107 transitions. Word has length 289 [2025-03-08 05:56:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 3178 states and 4107 transitions. [2025-03-08 05:56:38,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:56:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4107 transitions. [2025-03-08 05:56:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 05:56:38,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:38,360 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:38,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 05:56:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 05:56:38,560 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -586162388, now seen corresponding path program 1 times [2025-03-08 05:56:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292799047] [2025-03-08 05:56:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:38,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 05:56:38,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 05:56:38,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:38,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-08 05:56:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292799047] [2025-03-08 05:56:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292799047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:38,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:38,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:38,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904843893] [2025-03-08 05:56:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:38,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:38,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:38,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:38,745 INFO L87 Difference]: Start difference. First operand 3178 states and 4107 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:56:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:38,916 INFO L93 Difference]: Finished difference Result 6178 states and 8173 transitions. [2025-03-08 05:56:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:56:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 295 [2025-03-08 05:56:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:38,932 INFO L225 Difference]: With dead ends: 6178 [2025-03-08 05:56:38,932 INFO L226 Difference]: Without dead ends: 3502 [2025-03-08 05:56:38,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:38,939 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 38 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:38,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 781 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-03-08 05:56:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3434. [2025-03-08 05:56:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2651 states have (on average 1.3115805356469257) internal successors, (3477), 2731 states have internal predecessors, (3477), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2025-03-08 05:56:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4507 transitions. [2025-03-08 05:56:39,062 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4507 transitions. Word has length 295 [2025-03-08 05:56:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:39,063 INFO L471 AbstractCegarLoop]: Abstraction has 3434 states and 4507 transitions. [2025-03-08 05:56:39,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:56:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4507 transitions. [2025-03-08 05:56:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 05:56:39,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:39,066 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:39,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 05:56:39,066 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash 646113770, now seen corresponding path program 1 times [2025-03-08 05:56:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250381749] [2025-03-08 05:56:39,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 05:56:39,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 05:56:39,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:39,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-08 05:56:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250381749] [2025-03-08 05:56:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250381749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662180327] [2025-03-08 05:56:39,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:39,294 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:39,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 05:56:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 05:56:39,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 05:56:39,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:39,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:39,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 05:56:39,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-08 05:56:39,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662180327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:39,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 11 [2025-03-08 05:56:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569161191] [2025-03-08 05:56:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:56:39,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:39,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:56:39,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:39,557 INFO L87 Difference]: Start difference. First operand 3434 states and 4507 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:56:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:40,087 INFO L93 Difference]: Finished difference Result 7948 states and 10416 transitions. [2025-03-08 05:56:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:56:40,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 295 [2025-03-08 05:56:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:40,108 INFO L225 Difference]: With dead ends: 7948 [2025-03-08 05:56:40,108 INFO L226 Difference]: Without dead ends: 5020 [2025-03-08 05:56:40,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:56:40,117 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 604 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:40,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 2355 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:56:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2025-03-08 05:56:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4272. [2025-03-08 05:56:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3293 states have (on average 1.305192833282721) internal successors, (4298), 3389 states have internal predecessors, (4298), 643 states have call successors, (643), 335 states have call predecessors, (643), 335 states have return successors, (643), 555 states have call predecessors, (643), 643 states have call successors, (643) [2025-03-08 05:56:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5584 transitions. [2025-03-08 05:56:40,298 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5584 transitions. Word has length 295 [2025-03-08 05:56:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:40,298 INFO L471 AbstractCegarLoop]: Abstraction has 4272 states and 5584 transitions. [2025-03-08 05:56:40,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-08 05:56:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5584 transitions. [2025-03-08 05:56:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 05:56:40,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:40,301 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:40,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 05:56:40,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:40,502 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:40,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1089641194, now seen corresponding path program 1 times [2025-03-08 05:56:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623282185] [2025-03-08 05:56:40,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:40,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 05:56:40,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 05:56:40,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:40,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-08 05:56:40,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623282185] [2025-03-08 05:56:40,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623282185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:40,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005886651] [2025-03-08 05:56:40,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:40,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:40,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 05:56:40,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 05:56:40,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 05:56:40,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:56:40,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-08 05:56:40,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005886651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2025-03-08 05:56:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951415305] [2025-03-08 05:56:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:56:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:40,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:56:40,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:56:40,904 INFO L87 Difference]: Start difference. First operand 4272 states and 5584 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:56:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:41,220 INFO L93 Difference]: Finished difference Result 8164 states and 10673 transitions. [2025-03-08 05:56:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:41,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 295 [2025-03-08 05:56:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:41,237 INFO L225 Difference]: With dead ends: 8164 [2025-03-08 05:56:41,237 INFO L226 Difference]: Without dead ends: 4386 [2025-03-08 05:56:41,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:41,245 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 121 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:41,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1736 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2025-03-08 05:56:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4144. [2025-03-08 05:56:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 3197 states have (on average 1.2980919612136377) internal successors, (4150), 3289 states have internal predecessors, (4150), 615 states have call successors, (615), 331 states have call predecessors, (615), 331 states have return successors, (615), 531 states have call predecessors, (615), 615 states have call successors, (615) [2025-03-08 05:56:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5380 transitions. [2025-03-08 05:56:41,397 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5380 transitions. Word has length 295 [2025-03-08 05:56:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:41,397 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5380 transitions. [2025-03-08 05:56:41,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-08 05:56:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5380 transitions. [2025-03-08 05:56:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-08 05:56:41,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:41,399 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:41,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:41,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:41,600 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 989395654, now seen corresponding path program 1 times [2025-03-08 05:56:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9717276] [2025-03-08 05:56:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:41,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-08 05:56:41,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-08 05:56:41,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:41,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2025-03-08 05:56:41,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:41,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9717276] [2025-03-08 05:56:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9717276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:41,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357796507] [2025-03-08 05:56:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:41,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:41,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:41,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:41,730 INFO L87 Difference]: Start difference. First operand 4144 states and 5380 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 05:56:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:42,037 INFO L93 Difference]: Finished difference Result 6100 states and 7966 transitions. [2025-03-08 05:56:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 302 [2025-03-08 05:56:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:42,049 INFO L225 Difference]: With dead ends: 6100 [2025-03-08 05:56:42,050 INFO L226 Difference]: Without dead ends: 2742 [2025-03-08 05:56:42,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:42,056 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 441 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:42,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 886 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2025-03-08 05:56:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2714. [2025-03-08 05:56:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2106 states have (on average 1.2763532763532763) internal successors, (2688), 2162 states have internal predecessors, (2688), 399 states have call successors, (399), 208 states have call predecessors, (399), 208 states have return successors, (399), 343 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-08 05:56:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3486 transitions. [2025-03-08 05:56:42,179 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3486 transitions. Word has length 302 [2025-03-08 05:56:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:42,180 INFO L471 AbstractCegarLoop]: Abstraction has 2714 states and 3486 transitions. [2025-03-08 05:56:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 05:56:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3486 transitions. [2025-03-08 05:56:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 05:56:42,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:42,185 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:56:42,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 05:56:42,185 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1978073361, now seen corresponding path program 1 times [2025-03-08 05:56:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926142177] [2025-03-08 05:56:42,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:42,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 05:56:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 05:56:42,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:42,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 33 proven. 71 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-08 05:56:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926142177] [2025-03-08 05:56:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926142177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804108675] [2025-03-08 05:56:43,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:43,145 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:43,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 05:56:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 05:56:43,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 05:56:43,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:43,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:43,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 05:56:43,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 198 proven. 108 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-08 05:56:43,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 33 proven. 71 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-08 05:56:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804108675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 38 [2025-03-08 05:56:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071579761] [2025-03-08 05:56:44,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 05:56:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:44,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 05:56:44,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 05:56:44,394 INFO L87 Difference]: Start difference. First operand 2714 states and 3486 transitions. Second operand has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-08 05:56:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:48,730 INFO L93 Difference]: Finished difference Result 11572 states and 15641 transitions. [2025-03-08 05:56:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-08 05:56:48,731 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) Word has length 345 [2025-03-08 05:56:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:48,794 INFO L225 Difference]: With dead ends: 11572 [2025-03-08 05:56:48,794 INFO L226 Difference]: Without dead ends: 9644 [2025-03-08 05:56:48,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 679 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1543, Invalid=8357, Unknown=0, NotChecked=0, Total=9900 [2025-03-08 05:56:48,805 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1746 mSDsluCounter, 9299 mSDsCounter, 0 mSdLazyCounter, 6284 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 9923 SdHoareTripleChecker+Invalid, 6971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 6284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:48,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 9923 Invalid, 6971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 6284 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 05:56:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2025-03-08 05:56:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 7124. [2025-03-08 05:56:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7124 states, 5472 states have (on average 1.287828947368421) internal successors, (7047), 5576 states have internal predecessors, (7047), 1111 states have call successors, (1111), 516 states have call predecessors, (1111), 540 states have return successors, (1159), 1031 states have call predecessors, (1159), 1111 states have call successors, (1159) [2025-03-08 05:56:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 9317 transitions. [2025-03-08 05:56:49,246 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 9317 transitions. Word has length 345 [2025-03-08 05:56:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 7124 states and 9317 transitions. [2025-03-08 05:56:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 6.777777777777778) internal successors, (244), 32 states have internal predecessors, (244), 9 states have call successors, (48), 8 states have call predecessors, (48), 18 states have return successors, (52), 12 states have call predecessors, (52), 8 states have call successors, (52) [2025-03-08 05:56:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 9317 transitions. [2025-03-08 05:56:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 05:56:49,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:49,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-08 05:56:49,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:49,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-08 05:56:49,461 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2120380430, now seen corresponding path program 1 times [2025-03-08 05:56:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189786656] [2025-03-08 05:56:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:49,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 05:56:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 05:56:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2025-03-08 05:56:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189786656] [2025-03-08 05:56:49,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189786656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442374282] [2025-03-08 05:56:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:49,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:49,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:49,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:49,612 INFO L87 Difference]: Start difference. First operand 7124 states and 9317 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 05:56:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:50,055 INFO L93 Difference]: Finished difference Result 14481 states and 18973 transitions. [2025-03-08 05:56:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:50,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 345 [2025-03-08 05:56:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:50,078 INFO L225 Difference]: With dead ends: 14481 [2025-03-08 05:56:50,078 INFO L226 Difference]: Without dead ends: 7028 [2025-03-08 05:56:50,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:50,091 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 26 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:50,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 670 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2025-03-08 05:56:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 7028. [2025-03-08 05:56:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7028 states, 5400 states have (on average 1.2555555555555555) internal successors, (6780), 5504 states have internal predecessors, (6780), 1111 states have call successors, (1111), 516 states have call predecessors, (1111), 516 states have return successors, (1111), 1007 states have call predecessors, (1111), 1111 states have call successors, (1111) [2025-03-08 05:56:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7028 states to 7028 states and 9002 transitions. [2025-03-08 05:56:50,420 INFO L78 Accepts]: Start accepts. Automaton has 7028 states and 9002 transitions. Word has length 345 [2025-03-08 05:56:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 7028 states and 9002 transitions. [2025-03-08 05:56:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-08 05:56:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7028 states and 9002 transitions. [2025-03-08 05:56:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-08 05:56:50,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:50,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 05:56:50,432 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -416601984, now seen corresponding path program 1 times [2025-03-08 05:56:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950551084] [2025-03-08 05:56:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 05:56:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 05:56:50,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:50,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2025-03-08 05:56:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950551084] [2025-03-08 05:56:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950551084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474585167] [2025-03-08 05:56:51,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:51,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:51,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:51,130 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:51,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 05:56:51,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-08 05:56:51,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-08 05:56:51,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:51,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:51,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:56:51,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 161 proven. 32 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-08 05:56:51,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2025-03-08 05:56:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474585167] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:56:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22, 7] total 32 [2025-03-08 05:56:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246869019] [2025-03-08 05:56:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:56:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:51,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:56:51,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=922, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:56:51,816 INFO L87 Difference]: Start difference. First operand 7028 states and 9002 transitions. Second operand has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:56:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:52,439 INFO L93 Difference]: Finished difference Result 15487 states and 20926 transitions. [2025-03-08 05:56:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:56:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 350 [2025-03-08 05:56:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:52,469 INFO L225 Difference]: With dead ends: 15487 [2025-03-08 05:56:52,469 INFO L226 Difference]: Without dead ends: 9345 [2025-03-08 05:56:52,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 05:56:52,479 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 113 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:52,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2542 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9345 states. [2025-03-08 05:56:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9345 to 6279. [2025-03-08 05:56:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 4824 states have (on average 1.2529021558872304) internal successors, (6044), 4918 states have internal predecessors, (6044), 992 states have call successors, (992), 462 states have call predecessors, (992), 462 states have return successors, (992), 898 states have call predecessors, (992), 992 states have call successors, (992) [2025-03-08 05:56:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 8028 transitions. [2025-03-08 05:56:52,851 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 8028 transitions. Word has length 350 [2025-03-08 05:56:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:52,852 INFO L471 AbstractCegarLoop]: Abstraction has 6279 states and 8028 transitions. [2025-03-08 05:56:52,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:56:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 8028 transitions. [2025-03-08 05:56:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 05:56:52,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:52,860 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:56:52,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-08 05:56:53,061 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1287637947, now seen corresponding path program 1 times [2025-03-08 05:56:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852949176] [2025-03-08 05:56:53,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 05:56:53,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 05:56:53,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2025-03-08 05:56:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852949176] [2025-03-08 05:56:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852949176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:53,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:53,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:56:53,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485162394] [2025-03-08 05:56:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:53,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:56:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:53,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:56:53,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:56:53,832 INFO L87 Difference]: Start difference. First operand 6279 states and 8028 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:56:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:54,351 INFO L93 Difference]: Finished difference Result 14261 states and 17981 transitions. [2025-03-08 05:56:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 355 [2025-03-08 05:56:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:54,376 INFO L225 Difference]: With dead ends: 14261 [2025-03-08 05:56:54,376 INFO L226 Difference]: Without dead ends: 9123 [2025-03-08 05:56:54,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:54,384 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 69 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:54,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1715 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2025-03-08 05:56:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 7518. [2025-03-08 05:56:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7518 states, 5762 states have (on average 1.2335994446372787) internal successors, (7108), 5884 states have internal predecessors, (7108), 1174 states have call successors, (1174), 581 states have call predecessors, (1174), 581 states have return successors, (1174), 1052 states have call predecessors, (1174), 1174 states have call successors, (1174) [2025-03-08 05:56:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7518 states to 7518 states and 9456 transitions. [2025-03-08 05:56:54,825 INFO L78 Accepts]: Start accepts. Automaton has 7518 states and 9456 transitions. Word has length 355 [2025-03-08 05:56:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:54,825 INFO L471 AbstractCegarLoop]: Abstraction has 7518 states and 9456 transitions. [2025-03-08 05:56:54,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 6 states have internal predecessors, (100), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:56:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 7518 states and 9456 transitions. [2025-03-08 05:56:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 05:56:54,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:54,837 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:56:54,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 05:56:54,837 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:54,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1866457044, now seen corresponding path program 1 times [2025-03-08 05:56:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:54,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726203202] [2025-03-08 05:56:54,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 05:56:54,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 05:56:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 05:56:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726203202] [2025-03-08 05:56:55,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726203202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:55,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851982663] [2025-03-08 05:56:55,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:55,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:55,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:55,733 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:55,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 05:56:55,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 05:56:55,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 05:56:55,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:55,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:55,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 05:56:55,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 260 proven. 126 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-08 05:56:56,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 05:56:57,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851982663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:57,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 43 [2025-03-08 05:56:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026468264] [2025-03-08 05:56:57,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 05:56:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:57,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 05:56:57,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 05:56:57,394 INFO L87 Difference]: Start difference. First operand 7518 states and 9456 transitions. Second operand has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-08 05:57:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:24,004 INFO L93 Difference]: Finished difference Result 91665 states and 125674 transitions. [2025-03-08 05:57:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2025-03-08 05:57:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) Word has length 365 [2025-03-08 05:57:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:24,314 INFO L225 Difference]: With dead ends: 91665 [2025-03-08 05:57:24,314 INFO L226 Difference]: Without dead ends: 85414 [2025-03-08 05:57:24,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 496 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107561 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=12442, Invalid=235064, Unknown=0, NotChecked=0, Total=247506 [2025-03-08 05:57:24,376 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 7907 mSDsluCounter, 38276 mSDsCounter, 0 mSdLazyCounter, 24146 mSolverCounterSat, 2811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7907 SdHoareTripleChecker+Valid, 39757 SdHoareTripleChecker+Invalid, 26957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2811 IncrementalHoareTripleChecker+Valid, 24146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:24,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7907 Valid, 39757 Invalid, 26957 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2811 Valid, 24146 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-08 05:57:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85414 states. [2025-03-08 05:57:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85414 to 25798. [2025-03-08 05:57:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25798 states, 19622 states have (on average 1.2327489552543065) internal successors, (24189), 20206 states have internal predecessors, (24189), 4126 states have call successors, (4126), 2049 states have call predecessors, (4126), 2049 states have return successors, (4126), 3542 states have call predecessors, (4126), 4126 states have call successors, (4126) [2025-03-08 05:57:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25798 states to 25798 states and 32441 transitions. [2025-03-08 05:57:27,439 INFO L78 Accepts]: Start accepts. Automaton has 25798 states and 32441 transitions. Word has length 365 [2025-03-08 05:57:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:27,440 INFO L471 AbstractCegarLoop]: Abstraction has 25798 states and 32441 transitions. [2025-03-08 05:57:27,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 7.190476190476191) internal successors, (302), 39 states have internal predecessors, (302), 19 states have call successors, (71), 8 states have call predecessors, (71), 10 states have return successors, (70), 21 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-08 05:57:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 25798 states and 32441 transitions. [2025-03-08 05:57:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-08 05:57:27,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:27,485 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:27,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 05:57:27,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-08 05:57:27,685 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -618876773, now seen corresponding path program 1 times [2025-03-08 05:57:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843807754] [2025-03-08 05:57:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 05:57:27,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 05:57:27,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:27,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 05:57:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:28,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843807754] [2025-03-08 05:57:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843807754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:28,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160214820] [2025-03-08 05:57:28,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:28,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:28,539 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:28,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 05:57:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-08 05:57:28,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-08 05:57:28,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:28,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 05:57:28,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 264 proven. 120 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-08 05:57:29,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 05:57:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160214820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:29,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 40 [2025-03-08 05:57:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238586689] [2025-03-08 05:57:29,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 05:57:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 05:57:29,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 05:57:29,800 INFO L87 Difference]: Start difference. First operand 25798 states and 32441 transitions. Second operand has 40 states, 39 states have (on average 8.384615384615385) internal successors, (327), 37 states have internal predecessors, (327), 21 states have call successors, (76), 8 states have call predecessors, (76), 10 states have return successors, (75), 22 states have call predecessors, (75), 20 states have call successors, (75)