./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.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/recursive/Primes.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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:33,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:33,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:33,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:33,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:33,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:33,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:33,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:33,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:33,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:33,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:33,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:33,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:33,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:33,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:33,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:33,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:33,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:33,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:33,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:33,155 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2025-03-08 05:42:33,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:33,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:33,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:33,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:33,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:33,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-08 05:42:34,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e53b576/894892f0db1f4fb892407dac307db41b/FLAG168360726 [2025-03-08 05:42:34,648 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:34,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-08 05:42:34,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e53b576/894892f0db1f4fb892407dac307db41b/FLAG168360726 [2025-03-08 05:42:34,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e53b576/894892f0db1f4fb892407dac307db41b [2025-03-08 05:42:34,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:34,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:34,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:34,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:34,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:34,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3febd2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34, skipping insertion in model container [2025-03-08 05:42:34,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:34,822 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/recursive/Primes.c[2190,2203] [2025-03-08 05:42:34,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:34,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:34,853 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/recursive/Primes.c[2190,2203] [2025-03-08 05:42:34,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:34,865 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:34,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34 WrapperNode [2025-03-08 05:42:34,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:34,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:34,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:34,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:34,873 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:42:34" (1/1) ... [2025-03-08 05:42:34,879 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:42:34" (1/1) ... [2025-03-08 05:42:34,893 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2025-03-08 05:42:34,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:34,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:34,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:34,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:34,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,913 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:42:34,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,916 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:34,923 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:34,923 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:34,923 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:34,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (1/1) ... [2025-03-08 05:42:34,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:34,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:34,948 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:42:34,951 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:42:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-08 05:42:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-08 05:42:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-08 05:42:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-08 05:42:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-08 05:42:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-08 05:42:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:35,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:35,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:35,094 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-08 05:42:35,094 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-08 05:42:35,094 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-08 05:42:35,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-08 05:42:35,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-08 05:42:35,170 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-08 05:42:35,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-08 05:42:35,198 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:35,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:35,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:35,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:35,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:35 BoogieIcfgContainer [2025-03-08 05:42:35,205 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:35,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:35,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:35,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:35,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:34" (1/3) ... [2025-03-08 05:42:35,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626489d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:35, skipping insertion in model container [2025-03-08 05:42:35,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:34" (2/3) ... [2025-03-08 05:42:35,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2626489d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:35, skipping insertion in model container [2025-03-08 05:42:35,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:35" (3/3) ... [2025-03-08 05:42:35,211 INFO L128 eAbstractionObserver]: Analyzing ICFG Primes.c [2025-03-08 05:42:35,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:35,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Primes.c that has 4 procedures, 52 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:35,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:35,265 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;@b7542f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:35,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:42:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 05:42:35,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:35,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:35,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1842113604, now seen corresponding path program 1 times [2025-03-08 05:42:35,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:35,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936708583] [2025-03-08 05:42:35,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:35,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:35,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 05:42:35,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 05:42:35,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:35,412 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:42:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936708583] [2025-03-08 05:42:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936708583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:42:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895462284] [2025-03-08 05:42:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:42:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:42:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:42:35,430 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:35,457 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2025-03-08 05:42:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:42:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 05:42:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:35,466 INFO L225 Difference]: With dead ends: 58 [2025-03-08 05:42:35,467 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 05:42:35,470 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:42:35,472 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:35,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 05:42:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 05:42:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:42:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2025-03-08 05:42:35,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2025-03-08 05:42:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2025-03-08 05:42:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2025-03-08 05:42:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 05:42:35,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:35,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:35,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:35,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:35,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:35,505 INFO L85 PathProgramCache]: Analyzing trace with hash 415110216, now seen corresponding path program 1 times [2025-03-08 05:42:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682690252] [2025-03-08 05:42:35,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:35,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 05:42:35,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 05:42:35,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:35,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:35,644 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:42:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682690252] [2025-03-08 05:42:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682690252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:42:35,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229936814] [2025-03-08 05:42:35,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:42:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:42:35,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:35,646 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:42:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:35,684 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2025-03-08 05:42:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:35,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-08 05:42:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:35,688 INFO L225 Difference]: With dead ends: 71 [2025-03-08 05:42:35,688 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 05:42:35,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:42:35,689 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:35,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 05:42:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 05:42:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-08 05:42:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-03-08 05:42:35,699 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2025-03-08 05:42:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-03-08 05:42:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:42:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-03-08 05:42:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:42:35,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:35,700 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] [2025-03-08 05:42:35,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:35,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash -92580458, now seen corresponding path program 1 times [2025-03-08 05:42:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:35,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742978643] [2025-03-08 05:42:35,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:42:35,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:42:35,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:35,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:35,826 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:42:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742978643] [2025-03-08 05:42:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742978643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:42:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455465557] [2025-03-08 05:42:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:42:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:42:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:35,828 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:35,860 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-08 05:42:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 05:42:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:35,862 INFO L225 Difference]: With dead ends: 57 [2025-03-08 05:42:35,862 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 05:42:35,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:35,862 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 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:42:35,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 05:42:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 05:42:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 05:42:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-08 05:42:35,869 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2025-03-08 05:42:35,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-08 05:42:35,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-03-08 05:42:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:42:35,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:35,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:35,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:42:35,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:35,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1970568421, now seen corresponding path program 1 times [2025-03-08 05:42:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:35,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693204363] [2025-03-08 05:42:35,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:35,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:42:35,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:42:35,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:35,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693204363] [2025-03-08 05:42:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693204363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:35,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355559697] [2025-03-08 05:42:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:35,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:35,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:35,938 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:36,018 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2025-03-08 05:42:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-08 05:42:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:36,020 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:42:36,020 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 05:42:36,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:36,021 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:36,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 05:42:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-08 05:42:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 05:42:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-08 05:42:36,029 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2025-03-08 05:42:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-08 05:42:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-03-08 05:42:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:42:36,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:36,035 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:42:36,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:42:36,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 982536466, now seen corresponding path program 1 times [2025-03-08 05:42:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091340245] [2025-03-08 05:42:36,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:36,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:42:36,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:42:36,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091340245] [2025-03-08 05:42:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091340245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257048814] [2025-03-08 05:42:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:36,137 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:42:36,139 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:42:36,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:42:36,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:42:36,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:36,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:36,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:36,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257048814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:36,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:36,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2025-03-08 05:42:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572935669] [2025-03-08 05:42:36,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:42:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:36,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:42:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:36,399 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:42:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:36,499 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-03-08 05:42:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2025-03-08 05:42:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:36,501 INFO L225 Difference]: With dead ends: 70 [2025-03-08 05:42:36,501 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 05:42:36,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:36,502 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:36,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 375 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 05:42:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 05:42:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-08 05:42:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-03-08 05:42:36,506 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2025-03-08 05:42:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:36,507 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-03-08 05:42:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:42:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-03-08 05:42:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:42:36,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:36,508 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:42:36,518 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:42:36,712 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:42:36,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 389818559, now seen corresponding path program 1 times [2025-03-08 05:42:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429113922] [2025-03-08 05:42:36,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:42:36,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:42:36,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:36,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429113922] [2025-03-08 05:42:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429113922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126971568] [2025-03-08 05:42:36,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:36,892 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:42:36,893 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:42:36,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:42:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:42:36,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:36,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:36,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:42:36,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:37,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126971568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:37,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-03-08 05:42:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100075404] [2025-03-08 05:42:37,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:37,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:42:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:37,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:42:37,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:42:37,293 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 05:42:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:37,593 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2025-03-08 05:42:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:42:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2025-03-08 05:42:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:37,595 INFO L225 Difference]: With dead ends: 72 [2025-03-08 05:42:37,598 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 05:42:37,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:42:37,599 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:37,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 607 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 05:42:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-08 05:42:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-08 05:42:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-08 05:42:37,609 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2025-03-08 05:42:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:37,609 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-08 05:42:37,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 15 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 05:42:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-08 05:42:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:42:37,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:37,610 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:42:37,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:42:37,814 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,SelfDestructingSolverStorable5 [2025-03-08 05:42:37,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:37,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1757502951, now seen corresponding path program 1 times [2025-03-08 05:42:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580614357] [2025-03-08 05:42:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:37,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:42:37,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:42:37,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:42:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:37,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580614357] [2025-03-08 05:42:37,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580614357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:37,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:37,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:42:37,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184346631] [2025-03-08 05:42:37,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:37,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:42:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:37,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:42:37,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:37,982 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,017 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-03-08 05:42:38,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-08 05:42:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,019 INFO L225 Difference]: With dead ends: 73 [2025-03-08 05:42:38,019 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 05:42:38,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:38,020 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 274 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 05:42:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-08 05:42:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-08 05:42:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-03-08 05:42:38,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2025-03-08 05:42:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,026 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-03-08 05:42:38,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:42:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-03-08 05:42:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:42:38,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:42:38,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 276018557, now seen corresponding path program 1 times [2025-03-08 05:42:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443377652] [2025-03-08 05:42:38,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:42:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:42:38,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:42:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443377652] [2025-03-08 05:42:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443377652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:42:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065741965] [2025-03-08 05:42:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:42:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:42:38,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:42:38,074 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:42:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,085 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2025-03-08 05:42:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:42:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2025-03-08 05:42:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,086 INFO L225 Difference]: With dead ends: 102 [2025-03-08 05:42:38,086 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 05:42:38,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:42:38,087 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 05:42:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 05:42:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-08 05:42:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-08 05:42:38,092 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 52 [2025-03-08 05:42:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,092 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-08 05:42:38,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:42:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-03-08 05:42:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 05:42:38,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:38,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:42:38,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1244786785, now seen corresponding path program 1 times [2025-03-08 05:42:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924518711] [2025-03-08 05:42:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 05:42:38,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 05:42:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:42:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924518711] [2025-03-08 05:42:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924518711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869755395] [2025-03-08 05:42:38,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:38,180 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:42:38,181 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:42:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 05:42:38,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 05:42:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:42:38,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:38,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:42:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869755395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:42:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 05:42:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677866642] [2025-03-08 05:42:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:38,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:38,260 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,306 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2025-03-08 05:42:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2025-03-08 05:42:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,310 INFO L225 Difference]: With dead ends: 111 [2025-03-08 05:42:38,310 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 05:42:38,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:42:38,310 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 05:42:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-08 05:42:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-08 05:42:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2025-03-08 05:42:38,316 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 53 [2025-03-08 05:42:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,316 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2025-03-08 05:42:38,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:42:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2025-03-08 05:42:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:42:38,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,317 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:38,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:38,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1909332967, now seen corresponding path program 1 times [2025-03-08 05:42:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-03-08 05:42:38,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:42:38,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:42:38,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:42:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842565881] [2025-03-08 05:42:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842565881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506908815] [2025-03-08 05:42:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:38,573 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:42:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,595 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-03-08 05:42:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-08 05:42:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,596 INFO L225 Difference]: With dead ends: 117 [2025-03-08 05:42:38,597 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 05:42:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:42:38,598 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 05:42:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-03-08 05:42:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 11 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-08 05:42:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-03-08 05:42:38,609 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 58 [2025-03-08 05:42:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-03-08 05:42:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:42:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-03-08 05:42:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:42:38,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,610 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:42:38,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:42:38,610 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -40373995, now seen corresponding path program 1 times [2025-03-08 05:42:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407823070] [2025-03-08 05:42:38,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:42:38,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:42:38,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:42:38,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407823070] [2025-03-08 05:42:38,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407823070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:38,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698306689] [2025-03-08 05:42:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:38,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:38,666 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:42:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,681 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2025-03-08 05:42:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-03-08 05:42:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,682 INFO L225 Difference]: With dead ends: 123 [2025-03-08 05:42:38,682 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 05:42:38,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:42:38,683 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 05:42:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-08 05:42:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 48 states have internal predecessors, (53), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (25), 12 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-08 05:42:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2025-03-08 05:42:38,690 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 61 [2025-03-08 05:42:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,690 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2025-03-08 05:42:38,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:42:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2025-03-08 05:42:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:42:38,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:42:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:42:38,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash -646414407, now seen corresponding path program 1 times [2025-03-08 05:42:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991293530] [2025-03-08 05:42:38,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:42:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:42:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:42:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991293530] [2025-03-08 05:42:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991293530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:42:38,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108964304] [2025-03-08 05:42:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:42:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:42:38,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:38,761 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:42:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,782 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2025-03-08 05:42:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-08 05:42:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,783 INFO L225 Difference]: With dead ends: 130 [2025-03-08 05:42:38,783 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 05:42:38,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:42:38,784 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 05:42:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2025-03-08 05:42:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-08 05:42:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2025-03-08 05:42:38,794 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 67 [2025-03-08 05:42:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,794 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-03-08 05:42:38,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:42:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2025-03-08 05:42:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:42:38,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-08 05:42:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:42:38,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash -150854869, now seen corresponding path program 1 times [2025-03-08 05:42:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275258354] [2025-03-08 05:42:38,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:42:38,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:42:38,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:42:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275258354] [2025-03-08 05:42:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275258354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:38,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:38,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:42:38,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431594708] [2025-03-08 05:42:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:42:38,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:38,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:42:38,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:42:38,880 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:42:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:38,897 INFO L93 Difference]: Finished difference Result 129 states and 171 transitions. [2025-03-08 05:42:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:42:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-08 05:42:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:38,899 INFO L225 Difference]: With dead ends: 129 [2025-03-08 05:42:38,899 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 05:42:38,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:42:38,899 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:38,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 05:42:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-08 05:42:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (28), 15 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-08 05:42:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-03-08 05:42:38,905 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 68 [2025-03-08 05:42:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:38,905 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-03-08 05:42:38,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:42:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-03-08 05:42:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:42:38,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:38,906 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:42:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:42:38,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:38,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:38,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1942840221, now seen corresponding path program 1 times [2025-03-08 05:42:38,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:38,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477923414] [2025-03-08 05:42:38,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:38,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:42:38,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:42:38,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:38,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477923414] [2025-03-08 05:42:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477923414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474798967] [2025-03-08 05:42:39,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:39,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:39,006 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:42:39,007 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:42:39,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:42:39,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:42:39,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:39,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:39,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:42:39,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:39,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474798967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:39,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 05:42:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66411289] [2025-03-08 05:42:39,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:39,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:42:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:39,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:42:39,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:42:39,418 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 05:42:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:39,572 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2025-03-08 05:42:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:42:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) Word has length 62 [2025-03-08 05:42:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:39,574 INFO L225 Difference]: With dead ends: 111 [2025-03-08 05:42:39,574 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 05:42:39,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:39,575 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:39,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 278 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 05:42:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2025-03-08 05:42:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 12 states have return successors, (34), 17 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 05:42:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-08 05:42:39,586 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 62 [2025-03-08 05:42:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-08 05:42:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 9 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-08 05:42:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-03-08 05:42:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:42:39,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,588 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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:42:39,594 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:42:39,792 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:42:39,792 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash 827845035, now seen corresponding path program 1 times [2025-03-08 05:42:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123669493] [2025-03-08 05:42:39,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:42:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:42:39,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:39,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:42:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123669493] [2025-03-08 05:42:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123669493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:39,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:42:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997459402] [2025-03-08 05:42:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:39,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:42:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:39,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:42:39,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:39,872 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:42:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:39,894 INFO L93 Difference]: Finished difference Result 159 states and 224 transitions. [2025-03-08 05:42:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:42:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:39,895 INFO L225 Difference]: With dead ends: 159 [2025-03-08 05:42:39,895 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 05:42:39,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:42:39,896 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:39,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 05:42:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-03-08 05:42:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 50 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2025-03-08 05:42:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2025-03-08 05:42:39,906 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 74 [2025-03-08 05:42:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:39,906 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2025-03-08 05:42:39,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:42:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2025-03-08 05:42:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:42:39,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:39,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-08 05:42:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:42:39,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash -177559633, now seen corresponding path program 2 times [2025-03-08 05:42:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713657488] [2025-03-08 05:42:39,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:39,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 05:42:39,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:42:39,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:42:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713657488] [2025-03-08 05:42:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713657488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460003804] [2025-03-08 05:42:40,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:40,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:40,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:40,063 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:42:40,065 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:42:40,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 05:42:40,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:42:40,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:40,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:42:40,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:42:40,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:42:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460003804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:40,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:40,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2025-03-08 05:42:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986219053] [2025-03-08 05:42:40,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:42:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:40,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:42:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:42:40,779 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 20 states have internal predecessors, (92), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:42:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:41,031 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2025-03-08 05:42:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:42:41,031 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 20 states have internal predecessors, (92), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) Word has length 71 [2025-03-08 05:42:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:41,032 INFO L225 Difference]: With dead ends: 122 [2025-03-08 05:42:41,032 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 05:42:41,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:42:41,033 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:41,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 386 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 05:42:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2025-03-08 05:42:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 60 states have internal predecessors, (69), 9 states have call successors, (9), 3 states have call predecessors, (9), 14 states have return successors, (42), 21 states have call predecessors, (42), 9 states have call successors, (42) [2025-03-08 05:42:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2025-03-08 05:42:41,045 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 71 [2025-03-08 05:42:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2025-03-08 05:42:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.411764705882353) internal successors, (92), 20 states have internal predecessors, (92), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) [2025-03-08 05:42:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2025-03-08 05:42:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:42:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:41,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:42:41,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:41,251 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:42:41,251 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash -882036813, now seen corresponding path program 1 times [2025-03-08 05:42:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454468467] [2025-03-08 05:42:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:42:41,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:42:41,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:42:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454468467] [2025-03-08 05:42:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454468467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879087778] [2025-03-08 05:42:41,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:41,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:41,290 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:42:41,291 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:42:41,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:42:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:42:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:42:41,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:42:41,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:42:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879087778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:41,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 05:42:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815395922] [2025-03-08 05:42:41,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:42:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:41,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:42:41,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:41,424 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:42:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:41,465 INFO L93 Difference]: Finished difference Result 196 states and 295 transitions. [2025-03-08 05:42:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) Word has length 68 [2025-03-08 05:42:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:41,466 INFO L225 Difference]: With dead ends: 196 [2025-03-08 05:42:41,466 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 05:42:41,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:41,467 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:41,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 236 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 05:42:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-08 05:42:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (29), 16 states have call predecessors, (29), 8 states have call successors, (29) [2025-03-08 05:42:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-03-08 05:42:41,472 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 68 [2025-03-08 05:42:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:41,472 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-03-08 05:42:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.2) internal successors, (56), 7 states have internal predecessors, (56), 5 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-08 05:42:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-03-08 05:42:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:42:41,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:41,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2025-03-08 05:42:41,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:41,677 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:42:41,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 210319419, now seen corresponding path program 1 times [2025-03-08 05:42:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560490300] [2025-03-08 05:42:41,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:41,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:42:41,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:42:41,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:41,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:42:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560490300] [2025-03-08 05:42:41,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560490300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:41,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:41,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:42:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659988839] [2025-03-08 05:42:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:41,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:42:41,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:41,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:42:41,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:42:41,719 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:42:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:41,747 INFO L93 Difference]: Finished difference Result 150 states and 215 transitions. [2025-03-08 05:42:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:42:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2025-03-08 05:42:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:41,748 INFO L225 Difference]: With dead ends: 150 [2025-03-08 05:42:41,748 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 05:42:41,748 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:42:41,748 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:41,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 173 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:42:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 05:42:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 05:42:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 57 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 13 states have return successors, (26), 16 states have call predecessors, (26), 8 states have call successors, (26) [2025-03-08 05:42:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2025-03-08 05:42:41,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 78 [2025-03-08 05:42:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:41,753 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2025-03-08 05:42:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:42:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2025-03-08 05:42:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:42:41,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:41,754 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2025-03-08 05:42:41,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:42:41,755 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:41,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash -291314303, now seen corresponding path program 2 times [2025-03-08 05:42:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:41,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-03-08 05:42:41,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:41,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:41,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-08 05:42:41,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:42:41,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:41,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:42:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-03-08 05:42:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521371225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907996103] [2025-03-08 05:42:41,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:41,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:41,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:41,874 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:42:41,876 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:42:41,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-08 05:42:41,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:42:41,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:41,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:42:41,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:42:42,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:42:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907996103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:43,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 24 [2025-03-08 05:42:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150345644] [2025-03-08 05:42:43,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 05:42:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 05:42:43,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:42:43,381 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-08 05:42:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:43,625 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2025-03-08 05:42:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:42:43,625 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) Word has length 87 [2025-03-08 05:42:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:43,626 INFO L225 Difference]: With dead ends: 125 [2025-03-08 05:42:43,626 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:42:43,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 05:42:43,627 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:43,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 284 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:42:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:42:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:42:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:42:43,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2025-03-08 05:42:43,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:42:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-08 05:42:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:42:43,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:42:43,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:42:43,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:43,836 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:43,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:42:44,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:42:44,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:42:44 BoogieIcfgContainer [2025-03-08 05:42:44,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:42:44,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:42:44,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:42:44,758 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:42:44,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:35" (3/4) ... [2025-03-08 05:42:44,760 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:42:44,764 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure multiple_of [2025-03-08 05:42:44,764 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mult [2025-03-08 05:42:44,765 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2025-03-08 05:42:44,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 05:42:44,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:42:44,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:42:44,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:42:44,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:42:44,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:42:44,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:42:44,822 INFO L158 Benchmark]: Toolchain (without parser) took 10140.57ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 108.7MB in the beginning and 113.7MB in the end (delta: -5.0MB). Peak memory consumption was 141.8MB. Max. memory is 16.1GB. [2025-03-08 05:42:44,822 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:44,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.07ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 97.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:44,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:44,823 INFO L158 Benchmark]: Boogie Preprocessor took 27.97ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 757.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:44,824 INFO L158 Benchmark]: IcfgBuilder took 282.06ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 80.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:42:44,825 INFO L158 Benchmark]: TraceAbstraction took 9551.42ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.4MB in the beginning and 121.8MB in the end (delta: -42.4MB). Peak memory consumption was 142.7MB. Max. memory is 16.1GB. [2025-03-08 05:42:44,825 INFO L158 Benchmark]: Witness Printer took 63.39ms. Allocated memory is still 293.6MB. Free memory was 121.8MB in the beginning and 113.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:44,826 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.07ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 97.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 95.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.97ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.4MB in the end (delta: 757.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.06ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 80.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9551.42ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 79.4MB in the beginning and 121.8MB in the end (delta: -42.4MB). Peak memory consumption was 142.7MB. Max. memory is 16.1GB. * Witness Printer took 63.39ms. Allocated memory is still 293.6MB. Free memory was 121.8MB in the beginning and 113.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 83 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 5191 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4157 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 1034 mSDtfsCounter, 1558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 727 SyntacticMatches, 20 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=16, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1384 NumberOfCodeBlocks, 1384 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1703 ConstructedInterpolants, 0 QuantifiedInterpolants, 3734 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1185 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 32 InterpolantComputations, 13 PerfectInterpolantSequences, 487/757 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 05:42:44,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE