./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:01:03,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:01:03,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:01:03,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:01:03,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:01:03,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:01:03,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:01:03,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:01:03,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:01:03,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:01:03,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:01:03,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:01:03,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:01:03,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:01:03,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:01:03,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:01:03,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:03,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:01:03,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:01:03,100 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 -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2025-03-03 16:01:03,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:01:03,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:01:03,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:01:03,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:01:03,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:01:03,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-03 16:01:04,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac85e9fd/92c1a0d2d5674b60a14bd2f10052d568/FLAG1ede36e63 [2025-03-03 16:01:05,007 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:01:05,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-03 16:01:05,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac85e9fd/92c1a0d2d5674b60a14bd2f10052d568/FLAG1ede36e63 [2025-03-03 16:01:05,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac85e9fd/92c1a0d2d5674b60a14bd2f10052d568 [2025-03-03 16:01:05,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:01:05,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:01:05,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:05,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:01:05,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:01:05,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:05" (1/1) ... [2025-03-03 16:01:05,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505924de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:05, skipping insertion in model container [2025-03-03 16:01:05,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:01:05" (1/1) ... [2025-03-03 16:01:05,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:01:05,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-03-03 16:01:05,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-03-03 16:01:05,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:05,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:01:05,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-03-03 16:01:05,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-03-03 16:01:06,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:01:06,193 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:01:06,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06 WrapperNode [2025-03-03 16:01:06,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:01:06,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:06,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:01:06,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:01:06,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,455 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-03-03 16:01:06,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:01:06,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:01:06,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:01:06,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:01:06,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,625 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:01:06,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:01:06,904 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:01:06,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:01:06,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:01:06,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (1/1) ... [2025-03-03 16:01:06,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:01:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:06,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:01:06,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:01:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:01:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:01:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:01:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:01:07,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:01:07,052 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:01:10,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2025-03-03 16:01:10,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2025-03-03 16:01:10,215 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2025-03-03 16:01:10,365 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-03-03 16:01:10,365 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:01:10,388 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:01:10,388 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:01:10,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:10 BoogieIcfgContainer [2025-03-03 16:01:10,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:01:10,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:01:10,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:01:10,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:01:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:01:05" (1/3) ... [2025-03-03 16:01:10,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd1b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:10, skipping insertion in model container [2025-03-03 16:01:10,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:01:06" (2/3) ... [2025-03-03 16:01:10,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bd1b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:01:10, skipping insertion in model container [2025-03-03 16:01:10,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:01:10" (3/3) ... [2025-03-03 16:01:10,395 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-03-03 16:01:10,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:01:10,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:01:10,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:01:10,477 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;@7e440f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:01:10,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:01:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 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-03 16:01:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 16:01:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:10,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:10,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 14776524, now seen corresponding path program 1 times [2025-03-03 16:01:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095939781] [2025-03-03 16:01:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:10,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 16:01:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 16:01:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:10,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095939781] [2025-03-03 16:01:10,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095939781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:10,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:01:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615528477] [2025-03-03 16:01:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:10,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:10,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:10,717 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-03 16:01:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:13,267 INFO L93 Difference]: Finished difference Result 2475 states and 4769 transitions. [2025-03-03 16:01:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 16:01:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:13,288 INFO L225 Difference]: With dead ends: 2475 [2025-03-03 16:01:13,288 INFO L226 Difference]: Without dead ends: 1557 [2025-03-03 16:01:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:13,295 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 906 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:13,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 570 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:01:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-03-03 16:01:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2025-03-03 16:01:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.6405144694533762) internal successors, (2551), 1556 states have internal predecessors, (2551), 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-03 16:01:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2551 transitions. [2025-03-03 16:01:13,395 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2551 transitions. Word has length 16 [2025-03-03 16:01:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2551 transitions. [2025-03-03 16:01:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-03 16:01:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2551 transitions. [2025-03-03 16:01:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:01:13,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:13,397 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] [2025-03-03 16:01:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:01:13,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-03-03 16:01:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579955731] [2025-03-03 16:01:13,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:13,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:01:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:01:13,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:13,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579955731] [2025-03-03 16:01:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579955731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:13,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:13,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:13,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860651591] [2025-03-03 16:01:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:13,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:13,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:13,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:13,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:13,554 INFO L87 Difference]: Start difference. First operand 1557 states and 2551 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-03 16:01:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:13,604 INFO L93 Difference]: Finished difference Result 1621 states and 2649 transitions. [2025-03-03 16:01:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:13,604 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 16:01:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:13,609 INFO L225 Difference]: With dead ends: 1621 [2025-03-03 16:01:13,609 INFO L226 Difference]: Without dead ends: 1587 [2025-03-03 16:01:13,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:13,611 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:13,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-03-03 16:01:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1557. [2025-03-03 16:01:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.630225080385852) internal successors, (2535), 1556 states have internal predecessors, (2535), 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-03 16:01:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2535 transitions. [2025-03-03 16:01:13,640 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2535 transitions. Word has length 20 [2025-03-03 16:01:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:13,640 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2535 transitions. [2025-03-03 16:01:13,640 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), 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-03 16:01:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2535 transitions. [2025-03-03 16:01:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 16:01:13,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:13,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:13,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:01:13,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-03-03 16:01:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:13,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251936292] [2025-03-03 16:01:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:13,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 16:01:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 16:01:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:13,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251936292] [2025-03-03 16:01:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251936292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413340150] [2025-03-03 16:01:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:13,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:13,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:13,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:13,789 INFO L87 Difference]: Start difference. First operand 1557 states and 2535 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-03 16:01:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:13,909 INFO L93 Difference]: Finished difference Result 1737 states and 2817 transitions. [2025-03-03 16:01:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:01:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-03 16:01:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:13,915 INFO L225 Difference]: With dead ends: 1737 [2025-03-03 16:01:13,915 INFO L226 Difference]: Without dead ends: 1707 [2025-03-03 16:01:13,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:13,916 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:13,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-03 16:01:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1585. [2025-03-03 16:01:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.629185091598231) internal successors, (2579), 1584 states have internal predecessors, (2579), 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-03 16:01:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2579 transitions. [2025-03-03 16:01:13,942 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2579 transitions. Word has length 35 [2025-03-03 16:01:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:13,942 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2579 transitions. [2025-03-03 16:01:13,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-03 16:01:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2579 transitions. [2025-03-03 16:01:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:13,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:13,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:13,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:01:13,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:13,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-03-03 16:01:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655770043] [2025-03-03 16:01:13,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:13,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:13,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655770043] [2025-03-03 16:01:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655770043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493595464] [2025-03-03 16:01:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,007 INFO L87 Difference]: Start difference. First operand 1585 states and 2579 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 16:01:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,033 INFO L93 Difference]: Finished difference Result 1690 states and 2742 transitions. [2025-03-03 16:01:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 16:01:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,039 INFO L225 Difference]: With dead ends: 1690 [2025-03-03 16:01:14,039 INFO L226 Difference]: Without dead ends: 1632 [2025-03-03 16:01:14,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,041 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-03-03 16:01:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2025-03-03 16:01:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.625921375921376) internal successors, (2647), 1629 states have internal predecessors, (2647), 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-03 16:01:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2647 transitions. [2025-03-03 16:01:14,069 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2647 transitions. Word has length 37 [2025-03-03 16:01:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2647 transitions. [2025-03-03 16:01:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-03 16:01:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2647 transitions. [2025-03-03 16:01:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 16:01:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:01:14,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-03-03 16:01:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391240771] [2025-03-03 16:01:14,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 16:01:14,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 16:01:14,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391240771] [2025-03-03 16:01:14,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391240771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611124176] [2025-03-03 16:01:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:14,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:14,227 INFO L87 Difference]: Start difference. First operand 1630 states and 2647 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-03 16:01:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,278 INFO L93 Difference]: Finished difference Result 1735 states and 2807 transitions. [2025-03-03 16:01:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 16:01:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,284 INFO L225 Difference]: With dead ends: 1735 [2025-03-03 16:01:14,284 INFO L226 Difference]: Without dead ends: 1632 [2025-03-03 16:01:14,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:01:14,285 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-03-03 16:01:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2025-03-03 16:01:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.6246928746928746) internal successors, (2645), 1629 states have internal predecessors, (2645), 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-03 16:01:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2645 transitions. [2025-03-03 16:01:14,310 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2645 transitions. Word has length 37 [2025-03-03 16:01:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,310 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2645 transitions. [2025-03-03 16:01:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-03 16:01:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2645 transitions. [2025-03-03 16:01:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 16:01:14,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:01:14,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-03-03 16:01:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274377718] [2025-03-03 16:01:14,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 16:01:14,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 16:01:14,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274377718] [2025-03-03 16:01:14,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274377718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:01:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571786251] [2025-03-03 16:01:14,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:01:14,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:01:14,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:14,494 INFO L87 Difference]: Start difference. First operand 1630 states and 2645 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-03 16:01:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,551 INFO L93 Difference]: Finished difference Result 1638 states and 2654 transitions. [2025-03-03 16:01:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:01:14,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 16:01:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,557 INFO L225 Difference]: With dead ends: 1638 [2025-03-03 16:01:14,557 INFO L226 Difference]: Without dead ends: 1636 [2025-03-03 16:01:14,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:01:14,559 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10498 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-03-03 16:01:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2025-03-03 16:01:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.6217870257037943) internal successors, (2650), 1635 states have internal predecessors, (2650), 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-03 16:01:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2650 transitions. [2025-03-03 16:01:14,585 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2650 transitions. Word has length 38 [2025-03-03 16:01:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,586 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2650 transitions. [2025-03-03 16:01:14,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-03 16:01:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2650 transitions. [2025-03-03 16:01:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:14,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:01:14,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-03-03 16:01:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735268962] [2025-03-03 16:01:14,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:14,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:14,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735268962] [2025-03-03 16:01:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735268962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154319815] [2025-03-03 16:01:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:14,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,631 INFO L87 Difference]: Start difference. First operand 1636 states and 2650 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,658 INFO L93 Difference]: Finished difference Result 1758 states and 2831 transitions. [2025-03-03 16:01:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 16:01:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,663 INFO L225 Difference]: With dead ends: 1758 [2025-03-03 16:01:14,663 INFO L226 Difference]: Without dead ends: 1694 [2025-03-03 16:01:14,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,665 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-03-03 16:01:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1692. [2025-03-03 16:01:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 1.6159763313609468) internal successors, (2731), 1691 states have internal predecessors, (2731), 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-03 16:01:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2731 transitions. [2025-03-03 16:01:14,690 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2731 transitions. Word has length 39 [2025-03-03 16:01:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,690 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 2731 transitions. [2025-03-03 16:01:14,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2731 transitions. [2025-03-03 16:01:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:14,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:01:14,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-03-03 16:01:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670780687] [2025-03-03 16:01:14,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670780687] [2025-03-03 16:01:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670780687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867924059] [2025-03-03 16:01:14,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:14,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,746 INFO L87 Difference]: Start difference. First operand 1692 states and 2731 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,766 INFO L93 Difference]: Finished difference Result 1994 states and 3171 transitions. [2025-03-03 16:01:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:14,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 16:01:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,773 INFO L225 Difference]: With dead ends: 1994 [2025-03-03 16:01:14,773 INFO L226 Difference]: Without dead ends: 1831 [2025-03-03 16:01:14,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,774 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-03 16:01:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2025-03-03 16:01:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1827 states have (on average 1.5998905309250138) internal successors, (2923), 1828 states have internal predecessors, (2923), 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-03 16:01:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2923 transitions. [2025-03-03 16:01:14,805 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2923 transitions. Word has length 39 [2025-03-03 16:01:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,807 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2923 transitions. [2025-03-03 16:01:14,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2923 transitions. [2025-03-03 16:01:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 16:01:14,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:01:14,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-03-03 16:01:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146591458] [2025-03-03 16:01:14,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 16:01:14,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 16:01:14,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146591458] [2025-03-03 16:01:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146591458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299569573] [2025-03-03 16:01:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:14,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:14,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,848 INFO L87 Difference]: Start difference. First operand 1829 states and 2923 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:14,873 INFO L93 Difference]: Finished difference Result 2381 states and 3705 transitions. [2025-03-03 16:01:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 16:01:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:14,880 INFO L225 Difference]: With dead ends: 2381 [2025-03-03 16:01:14,880 INFO L226 Difference]: Without dead ends: 2081 [2025-03-03 16:01:14,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:14,881 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:14,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-03-03 16:01:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2079. [2025-03-03 16:01:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.5690900337024554) internal successors, (3259), 2078 states have internal predecessors, (3259), 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-03 16:01:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3259 transitions. [2025-03-03 16:01:14,916 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3259 transitions. Word has length 39 [2025-03-03 16:01:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3259 transitions. [2025-03-03 16:01:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-03 16:01:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3259 transitions. [2025-03-03 16:01:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:14,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:14,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:01:14,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-03-03 16:01:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403082055] [2025-03-03 16:01:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:15,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403082055] [2025-03-03 16:01:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403082055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556116828] [2025-03-03 16:01:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:15,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:15,025 INFO L87 Difference]: Start difference. First operand 2079 states and 3259 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 16:01:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:15,097 INFO L93 Difference]: Finished difference Result 3711 states and 5535 transitions. [2025-03-03 16:01:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:01:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:15,107 INFO L225 Difference]: With dead ends: 3711 [2025-03-03 16:01:15,107 INFO L226 Difference]: Without dead ends: 3309 [2025-03-03 16:01:15,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:15,109 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:15,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-03-03 16:01:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2025-03-03 16:01:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.5334900117508814) internal successors, (3915), 2554 states have internal predecessors, (3915), 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-03 16:01:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3915 transitions. [2025-03-03 16:01:15,155 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3915 transitions. Word has length 54 [2025-03-03 16:01:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 3915 transitions. [2025-03-03 16:01:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03 16:01:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3915 transitions. [2025-03-03 16:01:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:15,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:15,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:01:15,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-03-03 16:01:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934412207] [2025-03-03 16:01:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:15,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:01:15,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:15,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934412207] [2025-03-03 16:01:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934412207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878959104] [2025-03-03 16:01:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:15,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:15,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:15,250 INFO L87 Difference]: Start difference. First operand 2555 states and 3915 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03 16:01:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:15,327 INFO L93 Difference]: Finished difference Result 4259 states and 6295 transitions. [2025-03-03 16:01:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:01:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:15,366 INFO L225 Difference]: With dead ends: 4259 [2025-03-03 16:01:15,366 INFO L226 Difference]: Without dead ends: 3709 [2025-03-03 16:01:15,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:15,367 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:15,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2025-03-03 16:01:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2025-03-03 16:01:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.4974250227203878) internal successors, (4943), 3302 states have internal predecessors, (4943), 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-03 16:01:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4943 transitions. [2025-03-03 16:01:15,423 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4943 transitions. Word has length 54 [2025-03-03 16:01:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4943 transitions. [2025-03-03 16:01:15,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-03 16:01:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4943 transitions. [2025-03-03 16:01:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 16:01:15,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:15,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:01:15,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-03-03 16:01:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911019096] [2025-03-03 16:01:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:15,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 16:01:15,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 16:01:15,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:15,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:01:15,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:15,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911019096] [2025-03-03 16:01:15,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911019096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:01:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261794404] [2025-03-03 16:01:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:15,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:01:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:15,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:01:15,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:15,508 INFO L87 Difference]: Start difference. First operand 3303 states and 4943 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03 16:01:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:15,593 INFO L93 Difference]: Finished difference Result 4807 states and 7051 transitions. [2025-03-03 16:01:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:01:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 16:01:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:15,609 INFO L225 Difference]: With dead ends: 4807 [2025-03-03 16:01:15,610 INFO L226 Difference]: Without dead ends: 4257 [2025-03-03 16:01:15,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:01:15,614 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:15,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-03-03 16:01:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2025-03-03 16:01:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.4806443232008313) internal successors, (5699), 3850 states have internal predecessors, (5699), 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-03 16:01:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5699 transitions. [2025-03-03 16:01:15,692 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5699 transitions. Word has length 54 [2025-03-03 16:01:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5699 transitions. [2025-03-03 16:01:15,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03 16:01:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5699 transitions. [2025-03-03 16:01:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 16:01:15,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:15,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:15,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:01:15,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-03-03 16:01:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578493325] [2025-03-03 16:01:15,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:15,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 16:01:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 16:01:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578493325] [2025-03-03 16:01:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578493325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049627573] [2025-03-03 16:01:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:15,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:15,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:15,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:15,769 INFO L87 Difference]: Start difference. First operand 3851 states and 5699 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-03 16:01:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:15,819 INFO L93 Difference]: Finished difference Result 6175 states and 8909 transitions. [2025-03-03 16:01:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 16:01:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:15,826 INFO L225 Difference]: With dead ends: 6175 [2025-03-03 16:01:15,827 INFO L226 Difference]: Without dead ends: 3853 [2025-03-03 16:01:15,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:15,830 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:15,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-03-03 16:01:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-03-03 16:01:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.4676539360872953) internal successors, (5649), 3850 states have internal predecessors, (5649), 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-03 16:01:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5649 transitions. [2025-03-03 16:01:15,903 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5649 transitions. Word has length 55 [2025-03-03 16:01:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:15,904 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5649 transitions. [2025-03-03 16:01:15,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-03 16:01:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5649 transitions. [2025-03-03 16:01:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 16:01:15,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:15,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:01:15,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-03-03 16:01:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955816831] [2025-03-03 16:01:15,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 16:01:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 16:01:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955816831] [2025-03-03 16:01:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955816831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:15,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:15,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468204921] [2025-03-03 16:01:15,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:15,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:15,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:15,968 INFO L87 Difference]: Start difference. First operand 3851 states and 5649 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03 16:01:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:16,000 INFO L93 Difference]: Finished difference Result 4770 states and 6909 transitions. [2025-03-03 16:01:16,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 16:01:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:16,007 INFO L225 Difference]: With dead ends: 4770 [2025-03-03 16:01:16,007 INFO L226 Difference]: Without dead ends: 2448 [2025-03-03 16:01:16,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:16,010 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:16,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-03-03 16:01:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2025-03-03 16:01:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.5274815422477441) internal successors, (3724), 2439 states have internal predecessors, (3724), 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-03 16:01:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3724 transitions. [2025-03-03 16:01:16,043 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3724 transitions. Word has length 56 [2025-03-03 16:01:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:16,044 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3724 transitions. [2025-03-03 16:01:16,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03 16:01:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3724 transitions. [2025-03-03 16:01:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 16:01:16,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:16,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:16,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:01:16,045 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:16,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-03-03 16:01:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621355217] [2025-03-03 16:01:16,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:16,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 16:01:16,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 16:01:16,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:16,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621355217] [2025-03-03 16:01:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621355217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498648281] [2025-03-03 16:01:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:16,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:16,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:16,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:16,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:16,106 INFO L87 Difference]: Start difference. First operand 2440 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 16:01:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:16,129 INFO L93 Difference]: Finished difference Result 2894 states and 4338 transitions. [2025-03-03 16:01:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:16,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 16:01:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:16,133 INFO L225 Difference]: With dead ends: 2894 [2025-03-03 16:01:16,133 INFO L226 Difference]: Without dead ends: 1992 [2025-03-03 16:01:16,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:16,135 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:16,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-03-03 16:01:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2025-03-03 16:01:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.5608651911468814) internal successors, (3103), 1989 states have internal predecessors, (3103), 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-03 16:01:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3103 transitions. [2025-03-03 16:01:16,161 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3103 transitions. Word has length 57 [2025-03-03 16:01:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:16,161 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3103 transitions. [2025-03-03 16:01:16,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 16:01:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3103 transitions. [2025-03-03 16:01:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 16:01:16,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:16,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:16,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:01:16,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-03-03 16:01:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458640606] [2025-03-03 16:01:16,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:16,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:16,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:16,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:16,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:16,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458640606] [2025-03-03 16:01:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458640606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:16,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469111414] [2025-03-03 16:01:16,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:16,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:01:16,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 16:01:16,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 16:01:16,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:16,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:16,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 16:01:16,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:16,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:01:16,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469111414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:16,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:16,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2025-03-03 16:01:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032335152] [2025-03-03 16:01:16,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:16,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:01:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:16,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:01:16,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:01:16,723 INFO L87 Difference]: Start difference. First operand 1990 states and 3103 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03 16:01:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:16,795 INFO L93 Difference]: Finished difference Result 3052 states and 4497 transitions. [2025-03-03 16:01:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:01:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-03 16:01:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:16,800 INFO L225 Difference]: With dead ends: 3052 [2025-03-03 16:01:16,800 INFO L226 Difference]: Without dead ends: 2600 [2025-03-03 16:01:16,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:01:16,801 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 2938 mSDsluCounter, 4598 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 6114 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:16,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 6114 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:01:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-03-03 16:01:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2545. [2025-03-03 16:01:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.4880062917813606) internal successors, (3784), 2544 states have internal predecessors, (3784), 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-03 16:01:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3784 transitions. [2025-03-03 16:01:16,843 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3784 transitions. Word has length 59 [2025-03-03 16:01:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3784 transitions. [2025-03-03 16:01:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-03 16:01:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3784 transitions. [2025-03-03 16:01:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:01:16,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:16,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:16,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:01:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:01:17,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-03-03 16:01:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999344289] [2025-03-03 16:01:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:17,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:17,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:17,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999344289] [2025-03-03 16:01:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999344289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594240754] [2025-03-03 16:01:17,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:17,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:17,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:01:17,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:01:17,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:01:17,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:17,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:17,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 16:01:17,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:18,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594240754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:19,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-03 16:01:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36502872] [2025-03-03 16:01:19,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 16:01:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:19,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 16:01:19,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:01:19,324 INFO L87 Difference]: Start difference. First operand 2545 states and 3784 transitions. Second operand has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 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-03 16:01:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:21,216 INFO L93 Difference]: Finished difference Result 4839 states and 6721 transitions. [2025-03-03 16:01:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 16:01:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:01:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:21,222 INFO L225 Difference]: With dead ends: 4839 [2025-03-03 16:01:21,222 INFO L226 Difference]: Without dead ends: 3853 [2025-03-03 16:01:21,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=696, Invalid=2844, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 16:01:21,224 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 8405 mSDsluCounter, 16500 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8405 SdHoareTripleChecker+Valid, 17988 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:21,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8405 Valid, 17988 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:01:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-03-03 16:01:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3843. [2025-03-03 16:01:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3843 states, 3841 states have (on average 1.3931267898984638) internal successors, (5351), 3842 states have internal predecessors, (5351), 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-03 16:01:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 5351 transitions. [2025-03-03 16:01:21,289 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 5351 transitions. Word has length 60 [2025-03-03 16:01:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:21,289 INFO L471 AbstractCegarLoop]: Abstraction has 3843 states and 5351 transitions. [2025-03-03 16:01:21,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 states have internal predecessors, (160), 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-03 16:01:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5351 transitions. [2025-03-03 16:01:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 16:01:21,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:21,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:21,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:01:21,490 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,SelfDestructingSolverStorable16 [2025-03-03 16:01:21,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:21,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2038076578, now seen corresponding path program 1 times [2025-03-03 16:01:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370995043] [2025-03-03 16:01:21,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:01:21,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:01:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:21,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370995043] [2025-03-03 16:01:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370995043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:21,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033183588] [2025-03-03 16:01:21,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:21,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:21,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:21,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:01:22,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 16:01:22,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 16:01:22,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:22,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:22,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:01:22,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:22,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033183588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:23,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-03 16:01:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158421111] [2025-03-03 16:01:23,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:23,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 16:01:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:23,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 16:01:23,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 16:01:23,131 INFO L87 Difference]: Start difference. First operand 3843 states and 5351 transitions. Second operand has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 states have internal predecessors, (167), 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-03 16:01:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:26,370 INFO L93 Difference]: Finished difference Result 11127 states and 14401 transitions. [2025-03-03 16:01:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-03 16:01:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 16:01:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:26,384 INFO L225 Difference]: With dead ends: 11127 [2025-03-03 16:01:26,384 INFO L226 Difference]: Without dead ends: 9433 [2025-03-03 16:01:26,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1666, Invalid=5474, Unknown=0, NotChecked=0, Total=7140 [2025-03-03 16:01:26,389 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 13918 mSDsluCounter, 24265 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13918 SdHoareTripleChecker+Valid, 25778 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:26,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13918 Valid, 25778 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:01:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2025-03-03 16:01:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 6035. [2025-03-03 16:01:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 6033 states have (on average 1.3258743576993204) internal successors, (7999), 6034 states have internal predecessors, (7999), 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-03 16:01:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 7999 transitions. [2025-03-03 16:01:26,534 INFO L78 Accepts]: Start accepts. Automaton has 6035 states and 7999 transitions. Word has length 61 [2025-03-03 16:01:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:26,535 INFO L471 AbstractCegarLoop]: Abstraction has 6035 states and 7999 transitions. [2025-03-03 16:01:26,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.771428571428571) internal successors, (167), 35 states have internal predecessors, (167), 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-03 16:01:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6035 states and 7999 transitions. [2025-03-03 16:01:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:01:26,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:26,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:26,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:01:26,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:01:26,737 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:26,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1218983721, now seen corresponding path program 1 times [2025-03-03 16:01:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:26,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302480683] [2025-03-03 16:01:26,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:26,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:01:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:01:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:26,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302480683] [2025-03-03 16:01:26,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302480683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:26,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447615179] [2025-03-03 16:01:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:26,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:26,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:26,786 INFO L87 Difference]: Start difference. First operand 6035 states and 7999 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03 16:01:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:29,218 INFO L93 Difference]: Finished difference Result 9041 states and 12926 transitions. [2025-03-03 16:01:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:29,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 16:01:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:29,233 INFO L225 Difference]: With dead ends: 9041 [2025-03-03 16:01:29,233 INFO L226 Difference]: Without dead ends: 7537 [2025-03-03 16:01:29,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:29,236 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 753 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:29,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1295 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:01:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7537 states. [2025-03-03 16:01:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7537 to 7537. [2025-03-03 16:01:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7537 states, 7535 states have (on average 1.3477106834771069) internal successors, (10155), 7536 states have internal predecessors, (10155), 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-03 16:01:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7537 states to 7537 states and 10155 transitions. [2025-03-03 16:01:29,372 INFO L78 Accepts]: Start accepts. Automaton has 7537 states and 10155 transitions. Word has length 87 [2025-03-03 16:01:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 7537 states and 10155 transitions. [2025-03-03 16:01:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-03 16:01:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7537 states and 10155 transitions. [2025-03-03 16:01:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:01:29,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:29,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:29,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:01:29,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:29,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash -330312124, now seen corresponding path program 1 times [2025-03-03 16:01:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888836575] [2025-03-03 16:01:29,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:29,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:01:29,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:01:29,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888836575] [2025-03-03 16:01:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888836575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:01:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068755756] [2025-03-03 16:01:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:29,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:01:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:29,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:01:29,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:29,461 INFO L87 Difference]: Start difference. First operand 7537 states and 10155 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03 16:01:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:31,890 INFO L93 Difference]: Finished difference Result 13547 states and 19394 transitions. [2025-03-03 16:01:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:01:31,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:01:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:31,905 INFO L225 Difference]: With dead ends: 13547 [2025-03-03 16:01:31,905 INFO L226 Difference]: Without dead ends: 10541 [2025-03-03 16:01:31,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:01:31,912 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 843 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:31,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 516 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 16:01:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10541 states. [2025-03-03 16:01:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10541 to 10541. [2025-03-03 16:01:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10541 states, 10539 states have (on average 1.3079039757092703) internal successors, (13784), 10540 states have internal predecessors, (13784), 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-03 16:01:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10541 states to 10541 states and 13784 transitions. [2025-03-03 16:01:32,074 INFO L78 Accepts]: Start accepts. Automaton has 10541 states and 13784 transitions. Word has length 90 [2025-03-03 16:01:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:32,074 INFO L471 AbstractCegarLoop]: Abstraction has 10541 states and 13784 transitions. [2025-03-03 16:01:32,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03 16:01:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 10541 states and 13784 transitions. [2025-03-03 16:01:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:01:32,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:32,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:01:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:01:32,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1960900528, now seen corresponding path program 1 times [2025-03-03 16:01:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968394246] [2025-03-03 16:01:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:32,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:01:32,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:01:32,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:32,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968394246] [2025-03-03 16:01:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968394246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:01:32,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:01:32,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:01:32,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441888132] [2025-03-03 16:01:32,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:01:32,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:01:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:32,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:01:32,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:01:32,257 INFO L87 Difference]: Start difference. First operand 10541 states and 13784 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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-03 16:01:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:34,488 INFO L93 Difference]: Finished difference Result 17302 states and 22904 transitions. [2025-03-03 16:01:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:01:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 16:01:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:34,500 INFO L225 Difference]: With dead ends: 17302 [2025-03-03 16:01:34,500 INFO L226 Difference]: Without dead ends: 11292 [2025-03-03 16:01:34,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:01:34,508 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 953 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:34,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1307 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 16:01:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11292 states. [2025-03-03 16:01:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11292 to 11292. [2025-03-03 16:01:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11292 states, 11290 states have (on average 1.287953941541187) internal successors, (14541), 11291 states have internal predecessors, (14541), 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-03 16:01:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 14541 transitions. [2025-03-03 16:01:34,675 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 14541 transitions. Word has length 97 [2025-03-03 16:01:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 11292 states and 14541 transitions. [2025-03-03 16:01:34,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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-03 16:01:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 14541 transitions. [2025-03-03 16:01:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:01:34,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:34,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-03 16:01:34,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:01:34,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:34,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1483083885, now seen corresponding path program 1 times [2025-03-03 16:01:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603518356] [2025-03-03 16:01:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:34,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:34,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:34,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:34,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603518356] [2025-03-03 16:01:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603518356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747227828] [2025-03-03 16:01:35,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:35,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:35,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:01:35,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:35,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:35,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:35,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:35,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:01:35,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:35,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747227828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:37,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:37,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-03-03 16:01:37,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190611199] [2025-03-03 16:01:37,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 16:01:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:37,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 16:01:37,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-03-03 16:01:37,224 INFO L87 Difference]: Start difference. First operand 11292 states and 14541 transitions. Second operand has 27 states, 27 states have (on average 7.814814814814815) internal successors, (211), 26 states have internal predecessors, (211), 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-03 16:01:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:37,817 INFO L93 Difference]: Finished difference Result 14318 states and 18296 transitions. [2025-03-03 16:01:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:01:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.814814814814815) internal successors, (211), 26 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 16:01:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:37,828 INFO L225 Difference]: With dead ends: 14318 [2025-03-03 16:01:37,828 INFO L226 Difference]: Without dead ends: 11444 [2025-03-03 16:01:37,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=1349, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 16:01:37,833 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 13336 mSDsluCounter, 12212 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13336 SdHoareTripleChecker+Valid, 13730 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13336 Valid, 13730 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:01:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11444 states. [2025-03-03 16:01:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11444 to 11292. [2025-03-03 16:01:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11292 states, 11290 states have (on average 1.2837023914969) internal successors, (14493), 11291 states have internal predecessors, (14493), 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-03 16:01:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 14493 transitions. [2025-03-03 16:01:38,056 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 14493 transitions. Word has length 99 [2025-03-03 16:01:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:38,056 INFO L471 AbstractCegarLoop]: Abstraction has 11292 states and 14493 transitions. [2025-03-03 16:01:38,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.814814814814815) internal successors, (211), 26 states have internal predecessors, (211), 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-03 16:01:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 14493 transitions. [2025-03-03 16:01:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:01:38,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:38,058 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-03 16:01:38,064 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-03 16:01:38,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:38,262 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:38,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash -397254221, now seen corresponding path program 1 times [2025-03-03 16:01:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:38,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688474558] [2025-03-03 16:01:38,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:38,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688474558] [2025-03-03 16:01:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688474558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:38,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241728344] [2025-03-03 16:01:38,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:38,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:38,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:38,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:01:38,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:38,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 16:01:38,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:39,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:40,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241728344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:40,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:40,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2025-03-03 16:01:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338986885] [2025-03-03 16:01:40,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:40,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 16:01:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:40,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 16:01:40,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 16:01:40,550 INFO L87 Difference]: Start difference. First operand 11292 states and 14493 transitions. Second operand has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 38 states have internal predecessors, (263), 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-03 16:01:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:01:46,516 INFO L93 Difference]: Finished difference Result 20248 states and 25371 transitions. [2025-03-03 16:01:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-03 16:01:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 38 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 16:01:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:01:46,533 INFO L225 Difference]: With dead ends: 20248 [2025-03-03 16:01:46,534 INFO L226 Difference]: Without dead ends: 17172 [2025-03-03 16:01:46,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4533 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2558, Invalid=13444, Unknown=0, NotChecked=0, Total=16002 [2025-03-03 16:01:46,541 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 22753 mSDsluCounter, 21933 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22753 SdHoareTripleChecker+Valid, 23487 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:01:46,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22753 Valid, 23487 Invalid, 2435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:01:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17172 states. [2025-03-03 16:01:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17172 to 12754. [2025-03-03 16:01:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12754 states, 12752 states have (on average 1.2713299874529485) internal successors, (16212), 12753 states have internal predecessors, (16212), 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-03 16:01:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12754 states to 12754 states and 16212 transitions. [2025-03-03 16:01:46,981 INFO L78 Accepts]: Start accepts. Automaton has 12754 states and 16212 transitions. Word has length 99 [2025-03-03 16:01:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:01:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 12754 states and 16212 transitions. [2025-03-03 16:01:46,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.743589743589744) internal successors, (263), 38 states have internal predecessors, (263), 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-03 16:01:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12754 states and 16212 transitions. [2025-03-03 16:01:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:01:46,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:01:46,984 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-03 16:01:46,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:01:47,184 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,SelfDestructingSolverStorable22 [2025-03-03 16:01:47,185 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:01:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:01:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -33303278, now seen corresponding path program 1 times [2025-03-03 16:01:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:01:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078343360] [2025-03-03 16:01:47,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:01:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 16:01:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:01:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078343360] [2025-03-03 16:01:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078343360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:01:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603599277] [2025-03-03 16:01:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:01:47,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:01:47,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:01:47,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:01:47,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:01:47,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:01:47,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:01:47,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:01:47,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:01:47,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 16:01:47,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:01:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 16:01:49,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:01:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:01:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603599277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:01:51,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:01:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 26] total 53 [2025-03-03 16:01:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955821285] [2025-03-03 16:01:51,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:01:51,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 16:01:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:01:51,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 16:01:51,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2422, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 16:01:51,946 INFO L87 Difference]: Start difference. First operand 12754 states and 16212 transitions. Second operand has 54 states, 54 states have (on average 3.814814814814815) internal successors, (206), 53 states have internal predecessors, (206), 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-03 16:02:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:02:00,906 INFO L93 Difference]: Finished difference Result 23200 states and 28834 transitions. [2025-03-03 16:02:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-03 16:02:00,906 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.814814814814815) internal successors, (206), 53 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 16:02:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:02:00,919 INFO L225 Difference]: With dead ends: 23200 [2025-03-03 16:02:00,919 INFO L226 Difference]: Without dead ends: 17488 [2025-03-03 16:02:00,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7369 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4683, Invalid=20757, Unknown=0, NotChecked=0, Total=25440 [2025-03-03 16:02:00,927 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 18660 mSDsluCounter, 23962 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18660 SdHoareTripleChecker+Valid, 25605 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:02:00,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18660 Valid, 25605 Invalid, 3092 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 16:02:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17488 states. [2025-03-03 16:02:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17488 to 14105. [2025-03-03 16:02:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14105 states, 14103 states have (on average 1.2623555271927958) internal successors, (17803), 14104 states have internal predecessors, (17803), 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-03 16:02:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14105 states to 14105 states and 17803 transitions. [2025-03-03 16:02:01,261 INFO L78 Accepts]: Start accepts. Automaton has 14105 states and 17803 transitions. Word has length 99 [2025-03-03 16:02:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:02:01,261 INFO L471 AbstractCegarLoop]: Abstraction has 14105 states and 17803 transitions. [2025-03-03 16:02:01,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.814814814814815) internal successors, (206), 53 states have internal predecessors, (206), 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-03 16:02:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14105 states and 17803 transitions. [2025-03-03 16:02:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:02:01,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:02:01,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:02:01,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 16:02:01,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:01,464 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:02:01,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:02:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1255973619, now seen corresponding path program 1 times [2025-03-03 16:02:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:02:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074055140] [2025-03-03 16:02:01,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:02:01,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:02:01,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:02:01,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:01,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:02,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:02:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074055140] [2025-03-03 16:02:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074055140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:02:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507460953] [2025-03-03 16:02:02,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:02:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:02:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:02:02,291 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:02:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:02:02,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:02:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:02:02,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:02:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:02:02,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 16:02:02,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:02:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:04,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:02:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:02:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507460953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:02:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:02:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18] total 54 [2025-03-03 16:02:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666609529] [2025-03-03 16:02:05,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:02:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 16:02:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:02:05,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 16:02:05,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2629, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 16:02:05,972 INFO L87 Difference]: Start difference. First operand 14105 states and 17803 transitions. Second operand has 54 states, 54 states have (on average 5.2592592592592595) internal successors, (284), 54 states have internal predecessors, (284), 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)