./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:46:17,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:46:17,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:46:17,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:46:17,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:46:17,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:46:17,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:46:17,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:46:17,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:46:17,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:46:17,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:46:17,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:46:17,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:46:17,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:46:17,307 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:46:17,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:46:17,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:46:17,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:46:17,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:17,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:46:17,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:46:17,310 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 -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2025-03-03 14:46:17,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:46:17,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:46:17,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:46:17,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:46:17,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:46:17,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-03 14:46:18,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544485934/8ec51060e0b3494da78c5f254e0704ce/FLAG92564c4a0 [2025-03-03 14:46:18,905 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:46:18,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-03 14:46:18,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544485934/8ec51060e0b3494da78c5f254e0704ce/FLAG92564c4a0 [2025-03-03 14:46:19,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544485934/8ec51060e0b3494da78c5f254e0704ce [2025-03-03 14:46:19,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:46:19,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:46:19,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:19,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:46:19,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:46:19,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410a6c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19, skipping insertion in model container [2025-03-03 14:46:19,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:46:19,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-03-03 14:46:19,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:19,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:46:19,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-03-03 14:46:19,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:46:19,487 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:46:19,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19 WrapperNode [2025-03-03 14:46:19,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:46:19,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:19,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:46:19,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:46:19,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,523 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2025-03-03 14:46:19,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:46:19,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:46:19,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:46:19,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:46:19,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,546 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 14:46:19,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:46:19,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:46:19,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:46:19,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:46:19,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (1/1) ... [2025-03-03 14:46:19,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:46:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:19,593 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 14:46:19,596 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 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:46:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:46:19,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:46:19,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:46:19,702 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:46:20,154 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-03 14:46:20,155 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:46:20,166 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:46:20,167 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:46:20,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:20 BoogieIcfgContainer [2025-03-03 14:46:20,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:46:20,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:46:20,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:46:20,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:46:20,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:46:19" (1/3) ... [2025-03-03 14:46:20,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0a5722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:20, skipping insertion in model container [2025-03-03 14:46:20,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:46:19" (2/3) ... [2025-03-03 14:46:20,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0a5722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:46:20, skipping insertion in model container [2025-03-03 14:46:20,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:46:20" (3/3) ... [2025-03-03 14:46:20,177 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-03 14:46:20,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:46:20,190 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c that has 6 procedures, 172 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:46:20,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:46:20,245 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;@56e0fc3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:46:20,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:46:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 133 states have (on average 1.593984962406015) internal successors, (212), 137 states have internal predecessors, (212), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 14:46:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 14:46:20,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:20,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1467400149, now seen corresponding path program 1 times [2025-03-03 14:46:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116652888] [2025-03-03 14:46:20,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 14:46:20,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 14:46:20,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,509 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 14:46:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116652888] [2025-03-03 14:46:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116652888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:20,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075028221] [2025-03-03 14:46:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:20,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:20,529 INFO L87 Difference]: Start difference. First operand has 172 states, 133 states have (on average 1.593984962406015) internal successors, (212), 137 states have internal predecessors, (212), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:20,637 INFO L93 Difference]: Finished difference Result 347 states and 588 transitions. [2025-03-03 14:46:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 14:46:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:20,646 INFO L225 Difference]: With dead ends: 347 [2025-03-03 14:46:20,646 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 14:46:20,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:20,651 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 7 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:20,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 782 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 14:46:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-03 14:46:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.5441176470588236) internal successors, (210), 139 states have internal predecessors, (210), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 14:46:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 274 transitions. [2025-03-03 14:46:20,686 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 274 transitions. Word has length 15 [2025-03-03 14:46:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:20,687 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 274 transitions. [2025-03-03 14:46:20,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 274 transitions. [2025-03-03 14:46:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:46:20,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:20,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:46:20,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2085440019, now seen corresponding path program 1 times [2025-03-03 14:46:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064058179] [2025-03-03 14:46:20,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:46:20,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:46:20,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,799 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 14:46:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064058179] [2025-03-03 14:46:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064058179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972500911] [2025-03-03 14:46:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:20,801 INFO L87 Difference]: Start difference. First operand 175 states and 274 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:20,861 INFO L93 Difference]: Finished difference Result 361 states and 569 transitions. [2025-03-03 14:46:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:20,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 14:46:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:20,863 INFO L225 Difference]: With dead ends: 361 [2025-03-03 14:46:20,863 INFO L226 Difference]: Without dead ends: 189 [2025-03-03 14:46:20,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:20,868 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 22 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:20,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-03 14:46:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-03 14:46:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 149 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 14:46:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 289 transitions. [2025-03-03 14:46:20,880 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 289 transitions. Word has length 16 [2025-03-03 14:46:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 289 transitions. [2025-03-03 14:46:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:46:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 289 transitions. [2025-03-03 14:46:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 14:46:20,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:20,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:46:20,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1634881528, now seen corresponding path program 1 times [2025-03-03 14:46:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405283571] [2025-03-03 14:46:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 14:46:20,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:46:20,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:20,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:20,978 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 14:46:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405283571] [2025-03-03 14:46:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405283571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:20,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538759154] [2025-03-03 14:46:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:20,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:20,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:20,980 INFO L87 Difference]: Start difference. First operand 187 states and 289 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,003 INFO L93 Difference]: Finished difference Result 393 states and 615 transitions. [2025-03-03 14:46:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-03 14:46:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,006 INFO L225 Difference]: With dead ends: 393 [2025-03-03 14:46:21,008 INFO L226 Difference]: Without dead ends: 216 [2025-03-03 14:46:21,008 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 14:46:21,009 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 22 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 534 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 14:46:21,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 534 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-03 14:46:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2025-03-03 14:46:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 151 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 14:46:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2025-03-03 14:46:21,033 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 22 [2025-03-03 14:46:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,033 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2025-03-03 14:46:21,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:46:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2025-03-03 14:46:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 14:46:21,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,034 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] [2025-03-03 14:46:21,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:46:21,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 681736040, now seen corresponding path program 1 times [2025-03-03 14:46:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017122876] [2025-03-03 14:46:21,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 14:46:21,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 14:46:21,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,147 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 14:46:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017122876] [2025-03-03 14:46:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017122876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314808340] [2025-03-03 14:46:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:21,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:21,148 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,197 INFO L93 Difference]: Finished difference Result 425 states and 670 transitions. [2025-03-03 14:46:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-03 14:46:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,202 INFO L225 Difference]: With dead ends: 425 [2025-03-03 14:46:21,202 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 14:46:21,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:21,203 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 117 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 783 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 14:46:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 189. [2025-03-03 14:46:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 151 states have internal predecessors, (221), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 14:46:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 287 transitions. [2025-03-03 14:46:21,249 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 287 transitions. Word has length 31 [2025-03-03 14:46:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,249 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 287 transitions. [2025-03-03 14:46:21,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 287 transitions. [2025-03-03 14:46:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 14:46:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:46:21,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1382767425, now seen corresponding path program 1 times [2025-03-03 14:46:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991761250] [2025-03-03 14:46:21,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 14:46:21,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 14:46:21,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991761250] [2025-03-03 14:46:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991761250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:21,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:21,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835670008] [2025-03-03 14:46:21,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:21,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:21,338 INFO L87 Difference]: Start difference. First operand 189 states and 287 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,372 INFO L93 Difference]: Finished difference Result 369 states and 564 transitions. [2025-03-03 14:46:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:21,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-03 14:46:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,375 INFO L225 Difference]: With dead ends: 369 [2025-03-03 14:46:21,375 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 14:46:21,376 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 14:46:21,377 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1042 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 14:46:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2025-03-03 14:46:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.4864864864864864) internal successors, (220), 151 states have internal predecessors, (220), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 14:46:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 286 transitions. [2025-03-03 14:46:21,388 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 286 transitions. Word has length 32 [2025-03-03 14:46:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,388 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 286 transitions. [2025-03-03 14:46:21,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2025-03-03 14:46:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 14:46:21,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:21,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:46:21,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,394 INFO L85 PathProgramCache]: Analyzing trace with hash -627385537, now seen corresponding path program 1 times [2025-03-03 14:46:21,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452261657] [2025-03-03 14:46:21,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:21,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:21,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452261657] [2025-03-03 14:46:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452261657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183711791] [2025-03-03 14:46:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:21,467 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 14:46:21,469 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 14:46:21,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 14:46:21,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 14:46:21,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:21,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:21,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:21,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:46:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183711791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:21,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 14:46:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610636733] [2025-03-03 14:46:21,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:21,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:21,625 INFO L87 Difference]: Start difference. First operand 189 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,664 INFO L93 Difference]: Finished difference Result 426 states and 659 transitions. [2025-03-03 14:46:21,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:21,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2025-03-03 14:46:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,667 INFO L225 Difference]: With dead ends: 426 [2025-03-03 14:46:21,667 INFO L226 Difference]: Without dead ends: 248 [2025-03-03 14:46:21,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:21,668 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 73 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 799 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-03 14:46:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2025-03-03 14:46:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.4607329842931938) internal successors, (279), 194 states have internal predecessors, (279), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 365 transitions. [2025-03-03 14:46:21,682 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 365 transitions. Word has length 34 [2025-03-03 14:46:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,682 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 365 transitions. [2025-03-03 14:46:21,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:46:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2025-03-03 14:46:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:21,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,684 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:21,692 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 14:46:21,889 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,SelfDestructingSolverStorable5 [2025-03-03 14:46:21,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1064988865, now seen corresponding path program 2 times [2025-03-03 14:46:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959690455] [2025-03-03 14:46:21,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:46:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:21,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-03 14:46:21,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 56 statements. [2025-03-03 14:46:21,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:46:21,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:46:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959690455] [2025-03-03 14:46:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959690455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657930640] [2025-03-03 14:46:21,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:21,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:21,935 INFO L87 Difference]: Start difference. First operand 242 states and 365 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:21,980 INFO L93 Difference]: Finished difference Result 463 states and 715 transitions. [2025-03-03 14:46:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:21,982 INFO L225 Difference]: With dead ends: 463 [2025-03-03 14:46:21,983 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 14:46:21,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:21,985 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 8 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:21,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 763 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 14:46:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-03-03 14:46:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 200 states have internal predecessors, (287), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 14:46:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 373 transitions. [2025-03-03 14:46:21,997 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 373 transitions. Word has length 56 [2025-03-03 14:46:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 373 transitions. [2025-03-03 14:46:21,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 373 transitions. [2025-03-03 14:46:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:46:21,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:21,999 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:46:21,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -738461399, now seen corresponding path program 1 times [2025-03-03 14:46:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702900195] [2025-03-03 14:46:22,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:46:22,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:46:22,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:46:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702900195] [2025-03-03 14:46:22,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702900195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501079684] [2025-03-03 14:46:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:22,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:22,059 INFO L87 Difference]: Start difference. First operand 249 states and 373 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,100 INFO L93 Difference]: Finished difference Result 507 states and 771 transitions. [2025-03-03 14:46:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:22,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2025-03-03 14:46:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,105 INFO L225 Difference]: With dead ends: 507 [2025-03-03 14:46:22,105 INFO L226 Difference]: Without dead ends: 286 [2025-03-03 14:46:22,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,108 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 22 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 778 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-03 14:46:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-03 14:46:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 231 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 415 transitions. [2025-03-03 14:46:22,124 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 415 transitions. Word has length 56 [2025-03-03 14:46:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 415 transitions. [2025-03-03 14:46:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:46:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 415 transitions. [2025-03-03 14:46:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:46:22,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,125 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:22,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:46:22,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1827336432, now seen corresponding path program 1 times [2025-03-03 14:46:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013254616] [2025-03-03 14:46:22,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:46:22,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:46:22,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-03 14:46:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013254616] [2025-03-03 14:46:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013254616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037942608] [2025-03-03 14:46:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:22,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,224 INFO L87 Difference]: Start difference. First operand 284 states and 415 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,253 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2025-03-03 14:46:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:22,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-03-03 14:46:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,255 INFO L225 Difference]: With dead ends: 519 [2025-03-03 14:46:22,255 INFO L226 Difference]: Without dead ends: 286 [2025-03-03 14:46:22,256 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 14:46:22,256 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1041 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-03 14:46:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-03 14:46:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 231 states have internal predecessors, (320), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:46:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions. [2025-03-03 14:46:22,272 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 412 transitions. Word has length 74 [2025-03-03 14:46:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,272 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 412 transitions. [2025-03-03 14:46:22,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2025-03-03 14:46:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:46:22,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,273 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:22,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:46:22,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1877411120, now seen corresponding path program 1 times [2025-03-03 14:46:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565693773] [2025-03-03 14:46:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:46:22,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:46:22,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 14:46:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565693773] [2025-03-03 14:46:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565693773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364951343] [2025-03-03 14:46:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:22,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:22,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:22,389 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,431 INFO L93 Difference]: Finished difference Result 554 states and 825 transitions. [2025-03-03 14:46:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-03 14:46:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,433 INFO L225 Difference]: With dead ends: 554 [2025-03-03 14:46:22,434 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 14:46:22,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,435 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 23 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 778 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 14:46:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-03-03 14:46:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 264 states have (on average 1.3674242424242424) internal successors, (361), 267 states have internal predecessors, (361), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:46:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 459 transitions. [2025-03-03 14:46:22,459 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 459 transitions. Word has length 102 [2025-03-03 14:46:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,459 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 459 transitions. [2025-03-03 14:46:22,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 459 transitions. [2025-03-03 14:46:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:46:22,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,460 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:46:22,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1409201320, now seen corresponding path program 1 times [2025-03-03 14:46:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897961708] [2025-03-03 14:46:22,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:46:22,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:46:22,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-03 14:46:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897961708] [2025-03-03 14:46:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897961708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794143567] [2025-03-03 14:46:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:22,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:22,545 INFO L87 Difference]: Start difference. First operand 324 states and 459 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,589 INFO L93 Difference]: Finished difference Result 580 states and 845 transitions. [2025-03-03 14:46:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2025-03-03 14:46:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,592 INFO L225 Difference]: With dead ends: 580 [2025-03-03 14:46:22,592 INFO L226 Difference]: Without dead ends: 318 [2025-03-03 14:46:22,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,593 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 9 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 746 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-03 14:46:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-03 14:46:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 262 states have internal predecessors, (349), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 14:46:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2025-03-03 14:46:22,606 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 103 [2025-03-03 14:46:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,607 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2025-03-03 14:46:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 14:46:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2025-03-03 14:46:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:46:22,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,609 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:22,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:46:22,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 237122916, now seen corresponding path program 1 times [2025-03-03 14:46:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75004991] [2025-03-03 14:46:22,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:46:22,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:46:22,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-03 14:46:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75004991] [2025-03-03 14:46:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75004991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648290428] [2025-03-03 14:46:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:22,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,710 INFO L87 Difference]: Start difference. First operand 318 states and 445 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,736 INFO L93 Difference]: Finished difference Result 556 states and 795 transitions. [2025-03-03 14:46:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 122 [2025-03-03 14:46:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,739 INFO L225 Difference]: With dead ends: 556 [2025-03-03 14:46:22,739 INFO L226 Difference]: Without dead ends: 320 [2025-03-03 14:46:22,739 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 14:46:22,740 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1025 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-03 14:46:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2025-03-03 14:46:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 259 states have (on average 1.335907335907336) internal successors, (346), 262 states have internal predecessors, (346), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 14:46:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 442 transitions. [2025-03-03 14:46:22,753 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 442 transitions. Word has length 122 [2025-03-03 14:46:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,753 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 442 transitions. [2025-03-03 14:46:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 442 transitions. [2025-03-03 14:46:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:46:22,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,754 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 14:46:22,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:46:22,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 990965476, now seen corresponding path program 1 times [2025-03-03 14:46:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579790539] [2025-03-03 14:46:22,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:46:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:46:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 14:46:22,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579790539] [2025-03-03 14:46:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579790539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:22,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:22,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399048809] [2025-03-03 14:46:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:22,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:22,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:22,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:22,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:22,840 INFO L87 Difference]: Start difference. First operand 318 states and 442 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:22,887 INFO L93 Difference]: Finished difference Result 519 states and 755 transitions. [2025-03-03 14:46:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-03-03 14:46:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:22,890 INFO L225 Difference]: With dead ends: 519 [2025-03-03 14:46:22,890 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 14:46:22,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:22,891 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 7 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:22,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 714 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 14:46:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-03 14:46:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 258 states have (on average 1.3333333333333333) internal successors, (344), 261 states have internal predecessors, (344), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 14:46:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 438 transitions. [2025-03-03 14:46:22,904 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 438 transitions. Word has length 154 [2025-03-03 14:46:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:22,904 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 438 transitions. [2025-03-03 14:46:22,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 14:46:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 438 transitions. [2025-03-03 14:46:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:46:22,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:22,906 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:22,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:46:22,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:22,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1993228826, now seen corresponding path program 1 times [2025-03-03 14:46:22,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:22,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627673482] [2025-03-03 14:46:22,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:22,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:46:22,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:46:22,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-03 14:46:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627673482] [2025-03-03 14:46:23,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627673482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:23,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:23,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027141290] [2025-03-03 14:46:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:23,027 INFO L87 Difference]: Start difference. First operand 316 states and 438 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,082 INFO L93 Difference]: Finished difference Result 459 states and 651 transitions. [2025-03-03 14:46:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 169 [2025-03-03 14:46:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,085 INFO L225 Difference]: With dead ends: 459 [2025-03-03 14:46:23,085 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 14:46:23,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:23,086 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 32 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 691 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 14:46:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-03 14:46:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 244 states have (on average 1.3237704918032787) internal successors, (323), 247 states have internal predecessors, (323), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 14:46:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 411 transitions. [2025-03-03 14:46:23,101 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 411 transitions. Word has length 169 [2025-03-03 14:46:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,101 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 411 transitions. [2025-03-03 14:46:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 411 transitions. [2025-03-03 14:46:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:46:23,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:46:23,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:23,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1483595851, now seen corresponding path program 1 times [2025-03-03 14:46:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136808418] [2025-03-03 14:46:23,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:46:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:46:23,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-03 14:46:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136808418] [2025-03-03 14:46:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136808418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:23,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919108815] [2025-03-03 14:46:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:23,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:23,222 INFO L87 Difference]: Start difference. First operand 299 states and 411 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,278 INFO L93 Difference]: Finished difference Result 442 states and 624 transitions. [2025-03-03 14:46:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 171 [2025-03-03 14:46:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,281 INFO L225 Difference]: With dead ends: 442 [2025-03-03 14:46:23,281 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 14:46:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:23,282 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 28 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 694 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 14:46:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-03 14:46:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.3157894736842106) internal successors, (300), 231 states have internal predecessors, (300), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:46:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 382 transitions. [2025-03-03 14:46:23,293 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 382 transitions. Word has length 171 [2025-03-03 14:46:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 382 transitions. [2025-03-03 14:46:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:46:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 382 transitions. [2025-03-03 14:46:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:46:23,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,297 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:23,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:46:23,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash -998191546, now seen corresponding path program 1 times [2025-03-03 14:46:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:23,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24392355] [2025-03-03 14:46:23,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:23,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:46:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:46:23,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-03 14:46:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24392355] [2025-03-03 14:46:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24392355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:23,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:46:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730910600] [2025-03-03 14:46:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:46:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:46:23,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:23,419 INFO L87 Difference]: Start difference. First operand 280 states and 382 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:46:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,445 INFO L93 Difference]: Finished difference Result 423 states and 595 transitions. [2025-03-03 14:46:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:23,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 172 [2025-03-03 14:46:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,448 INFO L225 Difference]: With dead ends: 423 [2025-03-03 14:46:23,448 INFO L226 Difference]: Without dead ends: 280 [2025-03-03 14:46:23,449 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 14:46:23,450 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1003 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-03 14:46:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-03 14:46:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 228 states have (on average 1.2894736842105263) internal successors, (294), 231 states have internal predecessors, (294), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:46:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2025-03-03 14:46:23,463 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 172 [2025-03-03 14:46:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,464 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2025-03-03 14:46:23,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:46:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2025-03-03 14:46:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 14:46:23,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,466 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 14:46:23,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:46:23,466 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:23,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1695324203, now seen corresponding path program 1 times [2025-03-03 14:46:23,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:23,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466862842] [2025-03-03 14:46:23,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:23,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 14:46:23,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 14:46:23,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466862842] [2025-03-03 14:46:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466862842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706395065] [2025-03-03 14:46:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:23,578 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 14:46:23,579 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 14:46:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 14:46:23,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 14:46:23,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:23,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:23,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:23,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:23,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-03 14:46:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706395065] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:23,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:46:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-03-03 14:46:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403961186] [2025-03-03 14:46:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:23,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:23,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:23,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:23,898 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 14:46:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:23,939 INFO L93 Difference]: Finished difference Result 443 states and 616 transitions. [2025-03-03 14:46:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 178 [2025-03-03 14:46:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:23,942 INFO L225 Difference]: With dead ends: 443 [2025-03-03 14:46:23,942 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 14:46:23,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 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 14:46:23,943 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 29 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:23,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 475 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 14:46:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-03 14:46:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 213 states have internal predecessors, (269), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 345 transitions. [2025-03-03 14:46:23,954 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 345 transitions. Word has length 178 [2025-03-03 14:46:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:23,954 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 345 transitions. [2025-03-03 14:46:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 14:46:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 345 transitions. [2025-03-03 14:46:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 14:46:23,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:23,956 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 14:46:23,964 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 14:46:24,160 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 14:46:24,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1903943210, now seen corresponding path program 1 times [2025-03-03 14:46:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322565587] [2025-03-03 14:46:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 14:46:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 14:46:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-03 14:46:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322565587] [2025-03-03 14:46:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322565587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:24,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146958268] [2025-03-03 14:46:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:24,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:24,261 INFO L87 Difference]: Start difference. First operand 259 states and 345 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:46:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:24,291 INFO L93 Difference]: Finished difference Result 399 states and 556 transitions. [2025-03-03 14:46:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:24,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 202 [2025-03-03 14:46:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:24,294 INFO L225 Difference]: With dead ends: 399 [2025-03-03 14:46:24,294 INFO L226 Difference]: Without dead ends: 263 [2025-03-03 14:46:24,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:24,295 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:24,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 734 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-03 14:46:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-03 14:46:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.2769953051643192) internal successors, (272), 216 states have internal predecessors, (272), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 348 transitions. [2025-03-03 14:46:24,306 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 348 transitions. Word has length 202 [2025-03-03 14:46:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:24,306 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 348 transitions. [2025-03-03 14:46:24,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:46:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 348 transitions. [2025-03-03 14:46:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:46:24,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:24,308 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:24,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:46:24,308 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 664424377, now seen corresponding path program 1 times [2025-03-03 14:46:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586942869] [2025-03-03 14:46:24,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 14:46:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:46:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-03 14:46:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586942869] [2025-03-03 14:46:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586942869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462790063] [2025-03-03 14:46:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:24,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:24,420 INFO L87 Difference]: Start difference. First operand 263 states and 348 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:24,449 INFO L93 Difference]: Finished difference Result 408 states and 564 transitions. [2025-03-03 14:46:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2025-03-03 14:46:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:24,452 INFO L225 Difference]: With dead ends: 408 [2025-03-03 14:46:24,452 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 14:46:24,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:24,453 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:24,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 736 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 14:46:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-03 14:46:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 217 states have (on average 1.271889400921659) internal successors, (276), 220 states have internal predecessors, (276), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:46:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 352 transitions. [2025-03-03 14:46:24,464 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 352 transitions. Word has length 209 [2025-03-03 14:46:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:24,465 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 352 transitions. [2025-03-03 14:46:24,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-03 14:46:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 352 transitions. [2025-03-03 14:46:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 14:46:24,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:24,466 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:46:24,467 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1467098633, now seen corresponding path program 1 times [2025-03-03 14:46:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328624374] [2025-03-03 14:46:24,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 14:46:24,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 14:46:24,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-03 14:46:24,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328624374] [2025-03-03 14:46:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328624374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944542822] [2025-03-03 14:46:24,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:24,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:24,585 INFO L87 Difference]: Start difference. First operand 268 states and 352 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:24,614 INFO L93 Difference]: Finished difference Result 412 states and 564 transitions. [2025-03-03 14:46:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:46:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2025-03-03 14:46:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:24,617 INFO L225 Difference]: With dead ends: 412 [2025-03-03 14:46:24,617 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 14:46:24,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:24,618 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:24,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 14:46:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-03 14:46:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 14:46:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 347 transitions. [2025-03-03 14:46:24,640 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 347 transitions. Word has length 217 [2025-03-03 14:46:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:24,640 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 347 transitions. [2025-03-03 14:46:24,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 14:46:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 347 transitions. [2025-03-03 14:46:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 14:46:24,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:24,642 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:46:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:46:24,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1130603792, now seen corresponding path program 1 times [2025-03-03 14:46:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613852826] [2025-03-03 14:46:24,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 14:46:24,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 14:46:24,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-03 14:46:24,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613852826] [2025-03-03 14:46:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613852826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:24,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163034588] [2025-03-03 14:46:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:24,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:24,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:24,764 INFO L87 Difference]: Start difference. First operand 267 states and 347 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:24,776 INFO L93 Difference]: Finished difference Result 410 states and 553 transitions. [2025-03-03 14:46:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2025-03-03 14:46:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:24,778 INFO L225 Difference]: With dead ends: 410 [2025-03-03 14:46:24,778 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 14:46:24,779 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 14:46:24,779 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:24,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 14:46:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-03 14:46:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.2534562211981566) internal successors, (272), 218 states have internal predecessors, (272), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 14:46:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 344 transitions. [2025-03-03 14:46:24,790 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 344 transitions. Word has length 225 [2025-03-03 14:46:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:24,791 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 344 transitions. [2025-03-03 14:46:24,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:46:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 344 transitions. [2025-03-03 14:46:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 14:46:24,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:24,792 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:46:24,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:46:24,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:24,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1712299377, now seen corresponding path program 1 times [2025-03-03 14:46:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888946945] [2025-03-03 14:46:24,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:24,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 14:46:24,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 14:46:24,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:24,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-03 14:46:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888946945] [2025-03-03 14:46:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888946945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580090112] [2025-03-03 14:46:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:25,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:25,024 INFO L87 Difference]: Start difference. First operand 266 states and 344 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:46:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,087 INFO L93 Difference]: Finished difference Result 615 states and 822 transitions. [2025-03-03 14:46:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:25,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 226 [2025-03-03 14:46:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,090 INFO L225 Difference]: With dead ends: 615 [2025-03-03 14:46:25,090 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 14:46:25,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 14:46:25,092 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 312 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 689 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 14:46:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 418. [2025-03-03 14:46:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 339 states have (on average 1.3008849557522124) internal successors, (441), 341 states have internal predecessors, (441), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 14:46:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 549 transitions. [2025-03-03 14:46:25,109 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 549 transitions. Word has length 226 [2025-03-03 14:46:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 549 transitions. [2025-03-03 14:46:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:46:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 549 transitions. [2025-03-03 14:46:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 14:46:25,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,111 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:25,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:46:25,111 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1552084757, now seen corresponding path program 1 times [2025-03-03 14:46:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893287333] [2025-03-03 14:46:25,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 14:46:25,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 14:46:25,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 14:46:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893287333] [2025-03-03 14:46:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893287333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016401213] [2025-03-03 14:46:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:25,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:25,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:25,213 INFO L87 Difference]: Start difference. First operand 418 states and 549 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:46:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,244 INFO L93 Difference]: Finished difference Result 886 states and 1215 transitions. [2025-03-03 14:46:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 255 [2025-03-03 14:46:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,248 INFO L225 Difference]: With dead ends: 886 [2025-03-03 14:46:25,248 INFO L226 Difference]: Without dead ends: 659 [2025-03-03 14:46:25,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:25,249 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 167 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 504 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-03 14:46:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 497. [2025-03-03 14:46:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 408 states have (on average 1.3088235294117647) internal successors, (534), 411 states have internal predecessors, (534), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 14:46:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 652 transitions. [2025-03-03 14:46:25,287 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 652 transitions. Word has length 255 [2025-03-03 14:46:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,288 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 652 transitions. [2025-03-03 14:46:25,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:46:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 652 transitions. [2025-03-03 14:46:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 14:46:25,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,290 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:25,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:46:25,290 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash -79467379, now seen corresponding path program 1 times [2025-03-03 14:46:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426010214] [2025-03-03 14:46:25,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 14:46:25,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 14:46:25,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 14:46:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426010214] [2025-03-03 14:46:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426010214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325145447] [2025-03-03 14:46:25,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:25,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:25,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:25,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:25,375 INFO L87 Difference]: Start difference. First operand 497 states and 652 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:46:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,412 INFO L93 Difference]: Finished difference Result 1057 states and 1440 transitions. [2025-03-03 14:46:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:25,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 256 [2025-03-03 14:46:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,417 INFO L225 Difference]: With dead ends: 1057 [2025-03-03 14:46:25,417 INFO L226 Difference]: Without dead ends: 780 [2025-03-03 14:46:25,418 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 14:46:25,418 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 169 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 521 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-03 14:46:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 605. [2025-03-03 14:46:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 504 states have (on average 1.3174603174603174) internal successors, (664), 509 states have internal predecessors, (664), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 14:46:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 794 transitions. [2025-03-03 14:46:25,447 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 794 transitions. Word has length 256 [2025-03-03 14:46:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,447 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 794 transitions. [2025-03-03 14:46:25,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:46:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 794 transitions. [2025-03-03 14:46:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 14:46:25,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,449 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:25,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:46:25,450 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash 684281096, now seen corresponding path program 1 times [2025-03-03 14:46:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146409932] [2025-03-03 14:46:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 14:46:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 14:46:25,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 14:46:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146409932] [2025-03-03 14:46:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146409932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296729690] [2025-03-03 14:46:25,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:25,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:25,539 INFO L87 Difference]: Start difference. First operand 605 states and 794 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:25,597 INFO L93 Difference]: Finished difference Result 1267 states and 1722 transitions. [2025-03-03 14:46:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-03-03 14:46:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:25,602 INFO L225 Difference]: With dead ends: 1267 [2025-03-03 14:46:25,602 INFO L226 Difference]: Without dead ends: 914 [2025-03-03 14:46:25,603 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 14:46:25,604 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:25,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 537 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-03 14:46:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 711. [2025-03-03 14:46:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 602 states have (on average 1.3289036544850499) internal successors, (800), 611 states have internal predecessors, (800), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:46:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 938 transitions. [2025-03-03 14:46:25,636 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 938 transitions. Word has length 257 [2025-03-03 14:46:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:25,637 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 938 transitions. [2025-03-03 14:46:25,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 938 transitions. [2025-03-03 14:46:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 14:46:25,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:25,639 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:46:25,640 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1325822745, now seen corresponding path program 1 times [2025-03-03 14:46:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497272242] [2025-03-03 14:46:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 14:46:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 14:46:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-03 14:46:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497272242] [2025-03-03 14:46:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497272242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343213958] [2025-03-03 14:46:25,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:25,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:25,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:25,816 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 14:46:25,827 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 14:46:25,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 14:46:26,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 14:46:26,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:26,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-03 14:46:26,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:26,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343213958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:26,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:26,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:46:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479908600] [2025-03-03 14:46:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:26,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:26,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:26,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:46:26,036 INFO L87 Difference]: Start difference. First operand 711 states and 938 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:26,114 INFO L93 Difference]: Finished difference Result 1174 states and 1586 transitions. [2025-03-03 14:46:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-03-03 14:46:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:26,117 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:46:26,117 INFO L226 Difference]: Without dead ends: 711 [2025-03-03 14:46:26,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:46:26,119 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 31 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:26,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 661 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-03 14:46:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-03-03 14:46:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 602 states have (on average 1.318936877076412) internal successors, (794), 611 states have internal predecessors, (794), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:46:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 932 transitions. [2025-03-03 14:46:26,146 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 932 transitions. Word has length 257 [2025-03-03 14:46:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 932 transitions. [2025-03-03 14:46:26,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 932 transitions. [2025-03-03 14:46:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 14:46:26,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:26,149 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:26,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:46:26,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:26,354 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:26,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash 505612618, now seen corresponding path program 1 times [2025-03-03 14:46:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268970010] [2025-03-03 14:46:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:26,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 14:46:26,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 14:46:26,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-03-03 14:46:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268970010] [2025-03-03 14:46:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268970010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923467964] [2025-03-03 14:46:26,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:26,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:26,556 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 14:46:26,558 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 14:46:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 14:46:26,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 14:46:26,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:26,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:26,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:46:26,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 14:46:26,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923467964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:46:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405906107] [2025-03-03 14:46:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:26,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:26,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:46:26,794 INFO L87 Difference]: Start difference. First operand 711 states and 932 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:26,879 INFO L93 Difference]: Finished difference Result 1174 states and 1572 transitions. [2025-03-03 14:46:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 258 [2025-03-03 14:46:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:26,883 INFO L225 Difference]: With dead ends: 1174 [2025-03-03 14:46:26,884 INFO L226 Difference]: Without dead ends: 723 [2025-03-03 14:46:26,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:46:26,885 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 7 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:26,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 669 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-03 14:46:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-03-03 14:46:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 612 states have (on average 1.3202614379084967) internal successors, (808), 621 states have internal predecessors, (808), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:46:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 946 transitions. [2025-03-03 14:46:26,913 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 946 transitions. Word has length 258 [2025-03-03 14:46:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:26,913 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 946 transitions. [2025-03-03 14:46:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 946 transitions. [2025-03-03 14:46:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 14:46:26,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:26,916 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:26,924 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 14:46:27,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:46:27,116 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1016056355, now seen corresponding path program 1 times [2025-03-03 14:46:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:27,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862289781] [2025-03-03 14:46:27,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:27,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 14:46:27,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 14:46:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 14:46:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862289781] [2025-03-03 14:46:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862289781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:46:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764706819] [2025-03-03 14:46:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:46:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:27,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:46:27,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:46:27,295 INFO L87 Difference]: Start difference. First operand 723 states and 946 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:27,322 INFO L93 Difference]: Finished difference Result 1188 states and 1586 transitions. [2025-03-03 14:46:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:46:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2025-03-03 14:46:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:27,326 INFO L225 Difference]: With dead ends: 1188 [2025-03-03 14:46:27,326 INFO L226 Difference]: Without dead ends: 703 [2025-03-03 14:46:27,327 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 14:46:27,327 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:27,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-03 14:46:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2025-03-03 14:46:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 593 states have (on average 1.3052276559865092) internal successors, (774), 601 states have internal predecessors, (774), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 14:46:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 911 transitions. [2025-03-03 14:46:27,355 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 911 transitions. Word has length 259 [2025-03-03 14:46:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:27,355 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 911 transitions. [2025-03-03 14:46:27,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:46:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 911 transitions. [2025-03-03 14:46:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 14:46:27,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:27,357 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:27,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:46:27,357 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:27,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:27,358 INFO L85 PathProgramCache]: Analyzing trace with hash -957107187, now seen corresponding path program 1 times [2025-03-03 14:46:27,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:27,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098280099] [2025-03-03 14:46:27,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:27,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 14:46:27,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 14:46:27,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 14:46:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098280099] [2025-03-03 14:46:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098280099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109217545] [2025-03-03 14:46:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:27,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:27,642 INFO L87 Difference]: Start difference. First operand 703 states and 911 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:46:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:27,710 INFO L93 Difference]: Finished difference Result 1016 states and 1388 transitions. [2025-03-03 14:46:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:46:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 260 [2025-03-03 14:46:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:27,715 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:46:27,715 INFO L226 Difference]: Without dead ends: 1014 [2025-03-03 14:46:27,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:27,716 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 118 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:27,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1725 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-03 14:46:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 709. [2025-03-03 14:46:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 597 states have (on average 1.3031825795644891) internal successors, (778), 606 states have internal predecessors, (778), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:46:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 917 transitions. [2025-03-03 14:46:27,749 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 917 transitions. Word has length 260 [2025-03-03 14:46:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:27,749 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 917 transitions. [2025-03-03 14:46:27,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 14:46:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 917 transitions. [2025-03-03 14:46:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 14:46:27,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:27,751 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:46:27,752 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:27,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash -22845454, now seen corresponding path program 1 times [2025-03-03 14:46:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650826989] [2025-03-03 14:46:27,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:27,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 14:46:27,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 14:46:27,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:27,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 14:46:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650826989] [2025-03-03 14:46:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650826989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:28,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098033227] [2025-03-03 14:46:28,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:28,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:28,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:28,028 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 14:46:28,030 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 14:46:28,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 14:46:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 14:46:28,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:28,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:46:28,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 248 proven. 33 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-03 14:46:28,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 14:46:28,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098033227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:28,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:28,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-03 14:46:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376349997] [2025-03-03 14:46:28,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:46:28,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:46:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:46:28,693 INFO L87 Difference]: Start difference. First operand 709 states and 917 transitions. Second operand has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-03 14:46:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:29,111 INFO L93 Difference]: Finished difference Result 1704 states and 2281 transitions. [2025-03-03 14:46:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:29,111 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 268 [2025-03-03 14:46:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:29,119 INFO L225 Difference]: With dead ends: 1704 [2025-03-03 14:46:29,119 INFO L226 Difference]: Without dead ends: 1253 [2025-03-03 14:46:29,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 527 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:46:29,121 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 267 mSDsluCounter, 3516 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:29,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 3854 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:46:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-03 14:46:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 983. [2025-03-03 14:46:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 831 states have (on average 1.2936221419975933) internal successors, (1075), 841 states have internal predecessors, (1075), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2025-03-03 14:46:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1267 transitions. [2025-03-03 14:46:29,168 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1267 transitions. Word has length 268 [2025-03-03 14:46:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:29,168 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1267 transitions. [2025-03-03 14:46:29,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 14 states have internal predecessors, (143), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-03 14:46:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1267 transitions. [2025-03-03 14:46:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 14:46:29,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:29,171 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:29,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:29,372 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash 938768563, now seen corresponding path program 1 times [2025-03-03 14:46:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979635266] [2025-03-03 14:46:29,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 14:46:29,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 14:46:29,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:29,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-03-03 14:46:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979635266] [2025-03-03 14:46:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979635266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555583884] [2025-03-03 14:46:29,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:29,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:29,470 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 14:46:29,472 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 14:46:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 14:46:29,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 14:46:29,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:29,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:29,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:29,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 14:46:29,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555583884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379321829] [2025-03-03 14:46:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:29,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:29,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:29,669 INFO L87 Difference]: Start difference. First operand 983 states and 1267 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:46:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:29,741 INFO L93 Difference]: Finished difference Result 1832 states and 2401 transitions. [2025-03-03 14:46:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 268 [2025-03-03 14:46:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:29,746 INFO L225 Difference]: With dead ends: 1832 [2025-03-03 14:46:29,746 INFO L226 Difference]: Without dead ends: 967 [2025-03-03 14:46:29,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 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 14:46:29,748 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:29,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 666 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-03 14:46:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2025-03-03 14:46:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 820 states have (on average 1.2817073170731708) internal successors, (1051), 830 states have internal predecessors, (1051), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-03 14:46:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1234 transitions. [2025-03-03 14:46:29,807 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1234 transitions. Word has length 268 [2025-03-03 14:46:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:29,807 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1234 transitions. [2025-03-03 14:46:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:46:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1234 transitions. [2025-03-03 14:46:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 14:46:29,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:29,810 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:29,817 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 14:46:30,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:30,011 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:30,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -429489590, now seen corresponding path program 1 times [2025-03-03 14:46:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985413920] [2025-03-03 14:46:30,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:30,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 14:46:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 14:46:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-03 14:46:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985413920] [2025-03-03 14:46:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985413920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107884476] [2025-03-03 14:46:30,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:30,097 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 14:46:30,099 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 14:46:30,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 14:46:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 14:46:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:30,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:46:30,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-03 14:46:30,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107884476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:46:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945073338] [2025-03-03 14:46:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:30,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:30,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:30,291 INFO L87 Difference]: Start difference. First operand 967 states and 1234 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:30,348 INFO L93 Difference]: Finished difference Result 1681 states and 2186 transitions. [2025-03-03 14:46:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:30,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 271 [2025-03-03 14:46:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:30,352 INFO L225 Difference]: With dead ends: 1681 [2025-03-03 14:46:30,353 INFO L226 Difference]: Without dead ends: 823 [2025-03-03 14:46:30,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 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 14:46:30,354 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:30,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 694 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:46:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-03-03 14:46:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2025-03-03 14:46:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 694 states have (on average 1.280979827089337) internal successors, (889), 704 states have internal predecessors, (889), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:46:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1050 transitions. [2025-03-03 14:46:30,387 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1050 transitions. Word has length 271 [2025-03-03 14:46:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:30,388 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1050 transitions. [2025-03-03 14:46:30,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:46:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1050 transitions. [2025-03-03 14:46:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 14:46:30,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:30,390 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:30,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:46:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:30,592 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash -50112918, now seen corresponding path program 1 times [2025-03-03 14:46:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858228522] [2025-03-03 14:46:30,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:30,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 14:46:30,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:46:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 20 proven. 141 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-03 14:46:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858228522] [2025-03-03 14:46:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858228522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669462327] [2025-03-03 14:46:31,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:31,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:31,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:31,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:46:31,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 14:46:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:46:31,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:31,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:31,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:31,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:32,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669462327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:32,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2025-03-03 14:46:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196559396] [2025-03-03 14:46:32,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:32,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:46:32,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:32,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:46:32,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:46:32,076 INFO L87 Difference]: Start difference. First operand 823 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:32,623 INFO L93 Difference]: Finished difference Result 2208 states and 2827 transitions. [2025-03-03 14:46:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:32,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 283 [2025-03-03 14:46:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:32,630 INFO L225 Difference]: With dead ends: 2208 [2025-03-03 14:46:32,630 INFO L226 Difference]: Without dead ends: 1750 [2025-03-03 14:46:32,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:46:32,632 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 617 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 2741 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:46:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2025-03-03 14:46:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1384. [2025-03-03 14:46:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1157 states have (on average 1.2618841832324978) internal successors, (1460), 1172 states have internal predecessors, (1460), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 14:46:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1757 transitions. [2025-03-03 14:46:32,690 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1757 transitions. Word has length 283 [2025-03-03 14:46:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1757 transitions. [2025-03-03 14:46:32,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1757 transitions. [2025-03-03 14:46:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 14:46:32,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:32,694 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:32,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:46:32,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 14:46:32,894 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2039749543, now seen corresponding path program 1 times [2025-03-03 14:46:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815040501] [2025-03-03 14:46:32,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:32,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:32,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:32,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:32,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-03 14:46:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815040501] [2025-03-03 14:46:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815040501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:33,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:46:33,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566052801] [2025-03-03 14:46:33,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:33,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:46:33,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:33,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:46:33,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:33,030 INFO L87 Difference]: Start difference. First operand 1384 states and 1757 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:33,127 INFO L93 Difference]: Finished difference Result 2553 states and 3330 transitions. [2025-03-03 14:46:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:46:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 289 [2025-03-03 14:46:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:33,134 INFO L225 Difference]: With dead ends: 2553 [2025-03-03 14:46:33,134 INFO L226 Difference]: Without dead ends: 1519 [2025-03-03 14:46:33,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:46:33,137 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 37 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:33,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 965 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:46:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-03 14:46:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1477. [2025-03-03 14:46:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1229 states have (on average 1.273393002441009) internal successors, (1565), 1244 states have internal predecessors, (1565), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 14:46:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1904 transitions. [2025-03-03 14:46:33,196 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1904 transitions. Word has length 289 [2025-03-03 14:46:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:33,196 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 1904 transitions. [2025-03-03 14:46:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1904 transitions. [2025-03-03 14:46:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 14:46:33,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:33,198 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 14:46:33,199 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1022941595, now seen corresponding path program 1 times [2025-03-03 14:46:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731079526] [2025-03-03 14:46:33,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:33,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:33,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:33,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:33,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2025-03-03 14:46:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731079526] [2025-03-03 14:46:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731079526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873411426] [2025-03-03 14:46:33,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:33,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:33,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:33,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:33,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:46:33,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:34,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:34,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:34,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:34,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:46:34,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 14:46:34,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873411426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2025-03-03 14:46:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940662624] [2025-03-03 14:46:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:46:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:34,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:46:34,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:46:34,205 INFO L87 Difference]: Start difference. First operand 1477 states and 1904 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:34,703 INFO L93 Difference]: Finished difference Result 3489 states and 4497 transitions. [2025-03-03 14:46:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:46:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 289 [2025-03-03 14:46:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:34,713 INFO L225 Difference]: With dead ends: 3489 [2025-03-03 14:46:34,713 INFO L226 Difference]: Without dead ends: 2363 [2025-03-03 14:46:34,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:46:34,716 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 608 mSDsluCounter, 2405 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:34,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2787 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:46:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-03-03 14:46:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1704. [2025-03-03 14:46:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1419 states have (on average 1.262861169837914) internal successors, (1792), 1436 states have internal predecessors, (1792), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-03 14:46:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2185 transitions. [2025-03-03 14:46:34,786 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2185 transitions. Word has length 289 [2025-03-03 14:46:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:34,787 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 2185 transitions. [2025-03-03 14:46:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:46:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2185 transitions. [2025-03-03 14:46:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 14:46:34,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:34,788 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:34,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:34,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-03 14:46:34,993 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:34,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash -579414171, now seen corresponding path program 1 times [2025-03-03 14:46:34,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:34,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851552948] [2025-03-03 14:46:34,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:34,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:35,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:35,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:35,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-03 14:46:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851552948] [2025-03-03 14:46:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851552948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904762520] [2025-03-03 14:46:35,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:35,517 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:35,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:46:35,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:35,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:35,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:35,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:35,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:46:35,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-03 14:46:35,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:46:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904762520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:46:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-03 14:46:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036341726] [2025-03-03 14:46:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:35,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:46:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:35,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:46:35,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:46:35,836 INFO L87 Difference]: Start difference. First operand 1704 states and 2185 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,063 INFO L93 Difference]: Finished difference Result 3314 states and 4286 transitions. [2025-03-03 14:46:36,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:46:36,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 289 [2025-03-03 14:46:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,071 INFO L225 Difference]: With dead ends: 3314 [2025-03-03 14:46:36,071 INFO L226 Difference]: Without dead ends: 2074 [2025-03-03 14:46:36,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:46:36,074 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 122 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1697 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-03-03 14:46:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1819. [2025-03-03 14:46:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1515 states have (on average 1.2594059405940594) internal successors, (1908), 1526 states have internal predecessors, (1908), 211 states have call successors, (211), 93 states have call predecessors, (211), 92 states have return successors, (210), 199 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 14:46:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2329 transitions. [2025-03-03 14:46:36,145 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2329 transitions. Word has length 289 [2025-03-03 14:46:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 1819 states and 2329 transitions. [2025-03-03 14:46:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:46:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2329 transitions. [2025-03-03 14:46:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 14:46:36,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,147 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:36,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:46:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-03 14:46:36,348 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1601512132, now seen corresponding path program 1 times [2025-03-03 14:46:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477983242] [2025-03-03 14:46:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 14:46:36,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 14:46:36,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-03 14:46:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477983242] [2025-03-03 14:46:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477983242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:36,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:36,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887461052] [2025-03-03 14:46:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:36,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:36,466 INFO L87 Difference]: Start difference. First operand 1819 states and 2329 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:46:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,617 INFO L93 Difference]: Finished difference Result 3287 states and 4245 transitions. [2025-03-03 14:46:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:36,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 289 [2025-03-03 14:46:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:36,624 INFO L225 Difference]: With dead ends: 3287 [2025-03-03 14:46:36,624 INFO L226 Difference]: Without dead ends: 1836 [2025-03-03 14:46:36,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:36,626 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 241 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:36,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 668 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:46:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2025-03-03 14:46:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1709. [2025-03-03 14:46:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1422 states have (on average 1.258790436005626) internal successors, (1790), 1432 states have internal predecessors, (1790), 199 states have call successors, (199), 88 states have call predecessors, (199), 87 states have return successors, (198), 188 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 14:46:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2187 transitions. [2025-03-03 14:46:36,684 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2187 transitions. Word has length 289 [2025-03-03 14:46:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:36,684 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2187 transitions. [2025-03-03 14:46:36,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:46:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2187 transitions. [2025-03-03 14:46:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 14:46:36,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:36,686 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:46:36,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 14:46:36,686 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2061481913, now seen corresponding path program 1 times [2025-03-03 14:46:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910406902] [2025-03-03 14:46:36,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 14:46:36,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 14:46:36,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:36,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-03 14:46:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910406902] [2025-03-03 14:46:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910406902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:46:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426006693] [2025-03-03 14:46:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:36,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:46:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:36,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:46:36,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:46:36,781 INFO L87 Difference]: Start difference. First operand 1709 states and 2187 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 14:46:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:36,997 INFO L93 Difference]: Finished difference Result 2990 states and 3848 transitions. [2025-03-03 14:46:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:46:36,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 296 [2025-03-03 14:46:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:37,004 INFO L225 Difference]: With dead ends: 2990 [2025-03-03 14:46:37,004 INFO L226 Difference]: Without dead ends: 1642 [2025-03-03 14:46:37,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:46:37,007 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 426 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:37,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 890 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-03-03 14:46:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1402. [2025-03-03 14:46:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1175 states have (on average 1.2382978723404254) internal successors, (1455), 1183 states have internal predecessors, (1455), 156 states have call successors, (156), 70 states have call predecessors, (156), 70 states have return successors, (156), 148 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 14:46:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1767 transitions. [2025-03-03 14:46:37,062 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1767 transitions. Word has length 296 [2025-03-03 14:46:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:37,062 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 1767 transitions. [2025-03-03 14:46:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-03 14:46:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1767 transitions. [2025-03-03 14:46:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 14:46:37,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:37,065 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:37,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 14:46:37,065 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash -835934294, now seen corresponding path program 1 times [2025-03-03 14:46:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454516339] [2025-03-03 14:46:37,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:37,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 14:46:37,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 14:46:37,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-03-03 14:46:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454516339] [2025-03-03 14:46:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454516339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037488309] [2025-03-03 14:46:37,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:37,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:37,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:37,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:46:37,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 14:46:37,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 14:46:37,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:37,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:37,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 14:46:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 226 proven. 64 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-03 14:46:38,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-03 14:46:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037488309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:39,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 12] total 31 [2025-03-03 14:46:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462645960] [2025-03-03 14:46:39,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 14:46:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 14:46:39,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:46:39,073 INFO L87 Difference]: Start difference. First operand 1402 states and 1767 transitions. Second operand has 31 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 14 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 14 states have call predecessors, (54), 13 states have call successors, (54) [2025-03-03 14:46:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:43,526 INFO L93 Difference]: Finished difference Result 7334 states and 9841 transitions. [2025-03-03 14:46:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-03 14:46:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 14 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 14 states have call predecessors, (54), 13 states have call successors, (54) Word has length 338 [2025-03-03 14:46:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:43,548 INFO L225 Difference]: With dead ends: 7334 [2025-03-03 14:46:43,548 INFO L226 Difference]: Without dead ends: 6300 [2025-03-03 14:46:43,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1522, Invalid=12998, Unknown=0, NotChecked=0, Total=14520 [2025-03-03 14:46:43,553 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 3111 mSDsluCounter, 9699 mSDsCounter, 0 mSdLazyCounter, 4175 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 10162 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 4175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:43,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3111 Valid, 10162 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 4175 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 14:46:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states. [2025-03-03 14:46:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 2614. [2025-03-03 14:46:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2614 states, 2182 states have (on average 1.2593950504124656) internal successors, (2748), 2198 states have internal predecessors, (2748), 298 states have call successors, (298), 133 states have call predecessors, (298), 133 states have return successors, (298), 282 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-03 14:46:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 3344 transitions. [2025-03-03 14:46:43,725 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 3344 transitions. Word has length 338 [2025-03-03 14:46:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:43,726 INFO L471 AbstractCegarLoop]: Abstraction has 2614 states and 3344 transitions. [2025-03-03 14:46:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 9.2) internal successors, (276), 29 states have internal predecessors, (276), 14 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 14 states have call predecessors, (54), 13 states have call successors, (54) [2025-03-03 14:46:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3344 transitions. [2025-03-03 14:46:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 14:46:43,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:43,731 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:43,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:46:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 14:46:43,931 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1135005163, now seen corresponding path program 1 times [2025-03-03 14:46:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:43,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791433328] [2025-03-03 14:46:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:43,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 14:46:43,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 14:46:43,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:43,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2025-03-03 14:46:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:44,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791433328] [2025-03-03 14:46:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791433328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:46:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:46:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:46:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172414435] [2025-03-03 14:46:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:46:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:46:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:44,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:46:44,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:46:44,127 INFO L87 Difference]: Start difference. First operand 2614 states and 3344 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:44,448 INFO L93 Difference]: Finished difference Result 5174 states and 6652 transitions. [2025-03-03 14:46:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:46:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 338 [2025-03-03 14:46:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:44,463 INFO L225 Difference]: With dead ends: 5174 [2025-03-03 14:46:44,463 INFO L226 Difference]: Without dead ends: 3067 [2025-03-03 14:46:44,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:46:44,468 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 151 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 2188 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:46:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-03-03 14:46:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 2422. [2025-03-03 14:46:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2038 states have (on average 1.2482826300294407) internal successors, (2544), 2054 states have internal predecessors, (2544), 262 states have call successors, (262), 121 states have call predecessors, (262), 121 states have return successors, (262), 246 states have call predecessors, (262), 262 states have call successors, (262) [2025-03-03 14:46:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3068 transitions. [2025-03-03 14:46:44,605 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3068 transitions. Word has length 338 [2025-03-03 14:46:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:46:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 3068 transitions. [2025-03-03 14:46:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:46:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3068 transitions. [2025-03-03 14:46:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 14:46:44,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:46:44,609 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:46:44,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 14:46:44,609 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:46:44,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:46:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1968747289, now seen corresponding path program 1 times [2025-03-03 14:46:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:46:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161984220] [2025-03-03 14:46:44,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:46:44,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 14:46:44,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 14:46:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-03 14:46:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:46:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161984220] [2025-03-03 14:46:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161984220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:46:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762119924] [2025-03-03 14:46:45,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:46:45,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:46:45,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:46:45,341 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:46:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:46:45,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 14:46:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 14:46:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:46:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:46:45,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 14:46:45,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:46:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 226 proven. 62 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-03 14:46:46,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:46:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-03 14:46:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762119924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:46:46,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:46:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 28 [2025-03-03 14:46:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354522842] [2025-03-03 14:46:46,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:46:46,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:46:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:46:46,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:46:46,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:46:46,534 INFO L87 Difference]: Start difference. First operand 2422 states and 3068 transitions. Second operand has 28 states, 27 states have (on average 10.814814814814815) internal successors, (292), 27 states have internal predecessors, (292), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) [2025-03-03 14:46:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:46:59,358 INFO L93 Difference]: Finished difference Result 34574 states and 46462 transitions. [2025-03-03 14:46:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2025-03-03 14:46:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 10.814814814814815) internal successors, (292), 27 states have internal predecessors, (292), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) Word has length 339 [2025-03-03 14:46:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:46:59,439 INFO L225 Difference]: With dead ends: 34574 [2025-03-03 14:46:59,439 INFO L226 Difference]: Without dead ends: 32659 [2025-03-03 14:46:59,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38811 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8894, Invalid=81406, Unknown=0, NotChecked=0, Total=90300 [2025-03-03 14:46:59,459 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 10571 mSDsluCounter, 18071 mSDsCounter, 0 mSdLazyCounter, 8472 mSolverCounterSat, 2695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10571 SdHoareTripleChecker+Valid, 19586 SdHoareTripleChecker+Invalid, 11167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2695 IncrementalHoareTripleChecker+Valid, 8472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:46:59,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10571 Valid, 19586 Invalid, 11167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2695 Valid, 8472 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 14:46:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32659 states. [2025-03-03 14:47:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32659 to 5514. [2025-03-03 14:47:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 4571 states have (on average 1.2566178079194925) internal successors, (5744), 4613 states have internal predecessors, (5744), 650 states have call successors, (650), 292 states have call predecessors, (650), 292 states have return successors, (650), 608 states have call predecessors, (650), 650 states have call successors, (650) [2025-03-03 14:47:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 7044 transitions. [2025-03-03 14:47:00,246 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 7044 transitions. Word has length 339 [2025-03-03 14:47:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 7044 transitions. [2025-03-03 14:47:00,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 10.814814814814815) internal successors, (292), 27 states have internal predecessors, (292), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) [2025-03-03 14:47:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 7044 transitions. [2025-03-03 14:47:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 14:47:00,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:00,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:00,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:47:00,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:47:00,456 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:00,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash -812999983, now seen corresponding path program 1 times [2025-03-03 14:47:00,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:00,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988702697] [2025-03-03 14:47:00,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:00,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 14:47:00,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 14:47:00,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:00,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2025-03-03 14:47:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988702697] [2025-03-03 14:47:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988702697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:47:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821339753] [2025-03-03 14:47:01,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:01,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:47:01,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:47:01,153 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:47:01,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:47:01,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 14:47:01,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 14:47:01,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:01,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:01,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 14:47:01,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:47:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 195 proven. 92 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-03 14:47:01,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:47:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-03-03 14:47:02,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821339753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:47:02,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:47:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 43 [2025-03-03 14:47:02,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725966968] [2025-03-03 14:47:02,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:47:02,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:47:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:02,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:47:02,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:47:02,500 INFO L87 Difference]: Start difference. First operand 5514 states and 7044 transitions. Second operand has 43 states, 42 states have (on average 7.142857142857143) internal successors, (300), 39 states have internal predecessors, (300), 13 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 15 states have call predecessors, (55), 12 states have call successors, (55) [2025-03-03 14:47:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:25,577 INFO L93 Difference]: Finished difference Result 95435 states and 127561 transitions. [2025-03-03 14:47:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 439 states. [2025-03-03 14:47:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 7.142857142857143) internal successors, (300), 39 states have internal predecessors, (300), 13 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 15 states have call predecessors, (55), 12 states have call successors, (55) Word has length 340 [2025-03-03 14:47:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:25,835 INFO L225 Difference]: With dead ends: 95435 [2025-03-03 14:47:25,835 INFO L226 Difference]: Without dead ends: 90677 [2025-03-03 14:47:25,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1168 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98063 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=11410, Invalid=218510, Unknown=0, NotChecked=0, Total=229920 [2025-03-03 14:47:25,878 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 9234 mSDsluCounter, 23743 mSDsCounter, 0 mSdLazyCounter, 13151 mSolverCounterSat, 2581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9234 SdHoareTripleChecker+Valid, 24728 SdHoareTripleChecker+Invalid, 15732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2581 IncrementalHoareTripleChecker+Valid, 13151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:25,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9234 Valid, 24728 Invalid, 15732 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2581 Valid, 13151 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 14:47:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90677 states. [2025-03-03 14:47:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90677 to 12452. [2025-03-03 14:47:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12452 states, 10151 states have (on average 1.2518963648901587) internal successors, (12708), 10258 states have internal predecessors, (12708), 1603 states have call successors, (1603), 697 states have call predecessors, (1603), 697 states have return successors, (1603), 1496 states have call predecessors, (1603), 1603 states have call successors, (1603) [2025-03-03 14:47:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12452 states to 12452 states and 15914 transitions. [2025-03-03 14:47:27,791 INFO L78 Accepts]: Start accepts. Automaton has 12452 states and 15914 transitions. Word has length 340 [2025-03-03 14:47:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 12452 states and 15914 transitions. [2025-03-03 14:47:27,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 7.142857142857143) internal successors, (300), 39 states have internal predecessors, (300), 13 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 15 states have call predecessors, (55), 12 states have call successors, (55) [2025-03-03 14:47:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 12452 states and 15914 transitions. [2025-03-03 14:47:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 14:47:27,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:27,813 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:27,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 14:47:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-03 14:47:28,014 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:28,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash -589431425, now seen corresponding path program 1 times [2025-03-03 14:47:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040732119] [2025-03-03 14:47:28,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 14:47:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 14:47:28,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:28,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-03 14:47:28,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040732119] [2025-03-03 14:47:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040732119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:47:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226134107] [2025-03-03 14:47:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:28,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:47:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:28,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:47:28,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:47:28,217 INFO L87 Difference]: Start difference. First operand 12452 states and 15914 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:47:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:30,654 INFO L93 Difference]: Finished difference Result 28814 states and 36653 transitions. [2025-03-03 14:47:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:47:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 340 [2025-03-03 14:47:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:30,704 INFO L225 Difference]: With dead ends: 28814 [2025-03-03 14:47:30,704 INFO L226 Difference]: Without dead ends: 17582 [2025-03-03 14:47:30,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:47:30,727 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 279 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:30,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 3017 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:47:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17582 states. [2025-03-03 14:47:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17582 to 12344. [2025-03-03 14:47:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12344 states, 10079 states have (on average 1.2489334259351126) internal successors, (12588), 10186 states have internal predecessors, (12588), 1567 states have call successors, (1567), 697 states have call predecessors, (1567), 697 states have return successors, (1567), 1460 states have call predecessors, (1567), 1567 states have call successors, (1567) [2025-03-03 14:47:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12344 states to 12344 states and 15722 transitions. [2025-03-03 14:47:32,023 INFO L78 Accepts]: Start accepts. Automaton has 12344 states and 15722 transitions. Word has length 340 [2025-03-03 14:47:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 12344 states and 15722 transitions. [2025-03-03 14:47:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:47:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12344 states and 15722 transitions. [2025-03-03 14:47:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 14:47:32,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:32,041 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 14:47:32,041 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:32,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash -802370450, now seen corresponding path program 1 times [2025-03-03 14:47:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889955138] [2025-03-03 14:47:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 14:47:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 14:47:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2025-03-03 14:47:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889955138] [2025-03-03 14:47:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889955138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167522060] [2025-03-03 14:47:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:32,194 INFO L87 Difference]: Start difference. First operand 12344 states and 15722 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:47:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:33,193 INFO L93 Difference]: Finished difference Result 21629 states and 27626 transitions. [2025-03-03 14:47:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 340 [2025-03-03 14:47:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:33,227 INFO L225 Difference]: With dead ends: 21629 [2025-03-03 14:47:33,227 INFO L226 Difference]: Without dead ends: 9875 [2025-03-03 14:47:33,247 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 14:47:33,247 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:33,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-03-03 14:47:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 9875. [2025-03-03 14:47:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9875 states, 7930 states have (on average 1.2441361916771754) internal successors, (9866), 8026 states have internal predecessors, (9866), 1358 states have call successors, (1358), 586 states have call predecessors, (1358), 586 states have return successors, (1358), 1262 states have call predecessors, (1358), 1358 states have call successors, (1358) [2025-03-03 14:47:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9875 states to 9875 states and 12582 transitions. [2025-03-03 14:47:34,325 INFO L78 Accepts]: Start accepts. Automaton has 9875 states and 12582 transitions. Word has length 340 [2025-03-03 14:47:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:34,325 INFO L471 AbstractCegarLoop]: Abstraction has 9875 states and 12582 transitions. [2025-03-03 14:47:34,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:47:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 9875 states and 12582 transitions. [2025-03-03 14:47:34,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 14:47:34,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:34,338 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:34,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 14:47:34,339 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:34,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 558417475, now seen corresponding path program 1 times [2025-03-03 14:47:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:34,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845868840] [2025-03-03 14:47:34,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:34,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 14:47:34,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 14:47:34,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-03-03 14:47:34,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845868840] [2025-03-03 14:47:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845868840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:34,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:34,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239301038] [2025-03-03 14:47:34,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:34,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:34,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:34,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:34,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:34,492 INFO L87 Difference]: Start difference. First operand 9875 states and 12582 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:47:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:35,416 INFO L93 Difference]: Finished difference Result 14616 states and 18669 transitions. [2025-03-03 14:47:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 341 [2025-03-03 14:47:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:35,442 INFO L225 Difference]: With dead ends: 14616 [2025-03-03 14:47:35,442 INFO L226 Difference]: Without dead ends: 8499 [2025-03-03 14:47:35,451 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 14:47:35,452 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:35,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2025-03-03 14:47:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8499. [2025-03-03 14:47:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8499 states, 6800 states have (on average 1.243970588235294) internal successors, (8459), 6884 states have internal predecessors, (8459), 1187 states have call successors, (1187), 511 states have call predecessors, (1187), 511 states have return successors, (1187), 1103 states have call predecessors, (1187), 1187 states have call successors, (1187) [2025-03-03 14:47:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 10833 transitions. [2025-03-03 14:47:36,843 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 10833 transitions. Word has length 341 [2025-03-03 14:47:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:36,843 INFO L471 AbstractCegarLoop]: Abstraction has 8499 states and 10833 transitions. [2025-03-03 14:47:36,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:47:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 10833 transitions. [2025-03-03 14:47:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 14:47:36,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:36,854 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:36,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 14:47:36,854 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:36,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1157634637, now seen corresponding path program 1 times [2025-03-03 14:47:36,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:36,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063073131] [2025-03-03 14:47:36,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:36,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 14:47:36,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 14:47:36,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:36,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2025-03-03 14:47:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063073131] [2025-03-03 14:47:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063073131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804559744] [2025-03-03 14:47:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:37,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:37,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:37,006 INFO L87 Difference]: Start difference. First operand 8499 states and 10833 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:47:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:37,746 INFO L93 Difference]: Finished difference Result 12616 states and 16096 transitions. [2025-03-03 14:47:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 342 [2025-03-03 14:47:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:37,762 INFO L225 Difference]: With dead ends: 12616 [2025-03-03 14:47:37,762 INFO L226 Difference]: Without dead ends: 6310 [2025-03-03 14:47:37,768 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 14:47:37,768 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:37,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6310 states. [2025-03-03 14:47:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6310 to 6310. [2025-03-03 14:47:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6310 states, 5065 states have (on average 1.2347482724580454) internal successors, (6254), 5127 states have internal predecessors, (6254), 859 states have call successors, (859), 385 states have call predecessors, (859), 385 states have return successors, (859), 797 states have call predecessors, (859), 859 states have call successors, (859) [2025-03-03 14:47:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6310 states to 6310 states and 7972 transitions. [2025-03-03 14:47:38,439 INFO L78 Accepts]: Start accepts. Automaton has 6310 states and 7972 transitions. Word has length 342 [2025-03-03 14:47:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 6310 states and 7972 transitions. [2025-03-03 14:47:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:47:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6310 states and 7972 transitions. [2025-03-03 14:47:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-03 14:47:38,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:38,447 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:38,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 14:47:38,447 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1554131371, now seen corresponding path program 1 times [2025-03-03 14:47:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558626063] [2025-03-03 14:47:38,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:38,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-03 14:47:38,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-03 14:47:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2025-03-03 14:47:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:38,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558626063] [2025-03-03 14:47:38,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558626063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:38,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:47:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682121407] [2025-03-03 14:47:38,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:38,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:47:38,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:38,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:47:38,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:47:38,617 INFO L87 Difference]: Start difference. First operand 6310 states and 7972 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 7 states have internal predecessors, (120), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21)