./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash be53c51dc83e5173157f1fa4471313025cf2f600c0bad4f77c441750f4d9f9e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:54:07,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:54:07,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:54:07,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:54:07,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:54:07,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:54:07,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:54:07,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:54:07,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:54:07,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:54:07,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:54:07,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:54:07,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:54:07,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:54:07,587 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:54:07,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:54:07,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:54:07,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:07,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:54:07,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:54:07,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:54:07,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:54:07,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:54:07,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:54:07,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:54:07,590 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be53c51dc83e5173157f1fa4471313025cf2f600c0bad4f77c441750f4d9f9e8 [2025-03-16 21:54:07,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:54:07,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:54:07,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:54:07,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:54:07,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:54:07,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c [2025-03-16 21:54:09,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d7cf569/26fe011df3fc4486b5d703edac17d0c4/FLAG1ab6e3ecf [2025-03-16 21:54:09,327 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:54:09,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c [2025-03-16 21:54:09,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d7cf569/26fe011df3fc4486b5d703edac17d0c4/FLAG1ab6e3ecf [2025-03-16 21:54:09,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d7cf569/26fe011df3fc4486b5d703edac17d0c4 [2025-03-16 21:54:09,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:54:09,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:54:09,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:09,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:54:09,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:54:09,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6d1da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09, skipping insertion in model container [2025-03-16 21:54:09,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:54:09,500 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/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c[1247,1260] [2025-03-16 21:54:09,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:09,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:54:09,603 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/hardware-verification-bv/btor2c-lazyMod.h_Vlunc.c[1247,1260] [2025-03-16 21:54:09,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:09,680 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:54:09,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09 WrapperNode [2025-03-16 21:54:09,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:09,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:09,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:54:09,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:54:09,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,794 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 783 [2025-03-16 21:54:09,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:09,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:54:09,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:54:09,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:54:09,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,860 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-16 21:54:09,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:54:09,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:54:09,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:54:09,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:54:09,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (1/1) ... [2025-03-16 21:54:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:09,941 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-16 21:54:09,944 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-16 21:54:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:54:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:54:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:54:09,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:54:10,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:54:10,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:54:10,816 INFO L? ?]: Removed 470 outVars from TransFormulas that were not future-live. [2025-03-16 21:54:10,817 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:54:10,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:54:10,851 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:54:10,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:10 BoogieIcfgContainer [2025-03-16 21:54:10,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:54:10,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:54:10,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:54:10,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:54:10,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:54:09" (1/3) ... [2025-03-16 21:54:10,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2356019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:10, skipping insertion in model container [2025-03-16 21:54:10,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:09" (2/3) ... [2025-03-16 21:54:10,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2356019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:10, skipping insertion in model container [2025-03-16 21:54:10,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:10" (3/3) ... [2025-03-16 21:54:10,859 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vlunc.c [2025-03-16 21:54:10,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:54:10,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Vlunc.c that has 1 procedures, 176 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:54:10,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:54:10,919 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;@300bfabf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:54:10,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:54:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 174 states have (on average 1.5) internal successors, (261), 175 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 21:54:10,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:10,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:10,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:10,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1681218849, now seen corresponding path program 1 times [2025-03-16 21:54:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:10,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235458231] [2025-03-16 21:54:10,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:11,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 21:54:11,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 21:54:11,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:11,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:11,674 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-16 21:54:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235458231] [2025-03-16 21:54:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235458231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174506306] [2025-03-16 21:54:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:11,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:11,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:11,696 INFO L87 Difference]: Start difference. First operand has 176 states, 174 states have (on average 1.5) internal successors, (261), 175 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:11,833 INFO L93 Difference]: Finished difference Result 327 states and 487 transitions. [2025-03-16 21:54:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:11,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 21:54:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:11,845 INFO L225 Difference]: With dead ends: 327 [2025-03-16 21:54:11,846 INFO L226 Difference]: Without dead ends: 176 [2025-03-16 21:54:11,849 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-16 21:54:11,853 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:11,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-16 21:54:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-16 21:54:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 175 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 260 transitions. [2025-03-16 21:54:11,892 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 260 transitions. Word has length 68 [2025-03-16 21:54:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:11,892 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 260 transitions. [2025-03-16 21:54:11,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 260 transitions. [2025-03-16 21:54:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 21:54:11,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:11,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:11,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:54:11,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 582855980, now seen corresponding path program 1 times [2025-03-16 21:54:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250518039] [2025-03-16 21:54:11,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:11,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 21:54:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 21:54:11,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:11,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:12,201 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-16 21:54:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250518039] [2025-03-16 21:54:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250518039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869987350] [2025-03-16 21:54:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:12,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:12,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:12,205 INFO L87 Difference]: Start difference. First operand 176 states and 260 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:12,612 INFO L93 Difference]: Finished difference Result 658 states and 973 transitions. [2025-03-16 21:54:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 21:54:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:12,615 INFO L225 Difference]: With dead ends: 658 [2025-03-16 21:54:12,615 INFO L226 Difference]: Without dead ends: 319 [2025-03-16 21:54:12,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:12,617 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1187 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:12,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 730 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-16 21:54:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 214. [2025-03-16 21:54:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.483568075117371) internal successors, (316), 213 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 316 transitions. [2025-03-16 21:54:12,631 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 316 transitions. Word has length 69 [2025-03-16 21:54:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 316 transitions. [2025-03-16 21:54:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 316 transitions. [2025-03-16 21:54:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 21:54:12,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:12,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:12,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:54:12,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:12,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1381569585, now seen corresponding path program 1 times [2025-03-16 21:54:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573826524] [2025-03-16 21:54:12,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:12,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 21:54:12,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 21:54:12,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:12,905 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-16 21:54:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573826524] [2025-03-16 21:54:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573826524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131956315] [2025-03-16 21:54:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:12,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:12,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:12,906 INFO L87 Difference]: Start difference. First operand 214 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:13,225 INFO L93 Difference]: Finished difference Result 494 states and 728 transitions. [2025-03-16 21:54:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 21:54:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:13,227 INFO L225 Difference]: With dead ends: 494 [2025-03-16 21:54:13,227 INFO L226 Difference]: Without dead ends: 343 [2025-03-16 21:54:13,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:13,228 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 808 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:13,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 533 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-16 21:54:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 246. [2025-03-16 21:54:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.4816326530612245) internal successors, (363), 245 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2025-03-16 21:54:13,238 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 70 [2025-03-16 21:54:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2025-03-16 21:54:13,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2025-03-16 21:54:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 21:54:13,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:13,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:13,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:54:13,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:13,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1850084084, now seen corresponding path program 1 times [2025-03-16 21:54:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280142889] [2025-03-16 21:54:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 21:54:13,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 21:54:13,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:13,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:13,481 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-16 21:54:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280142889] [2025-03-16 21:54:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280142889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949817514] [2025-03-16 21:54:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:13,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:13,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:13,484 INFO L87 Difference]: Start difference. First operand 246 states and 363 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:13,840 INFO L93 Difference]: Finished difference Result 494 states and 727 transitions. [2025-03-16 21:54:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:13,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 21:54:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:13,842 INFO L225 Difference]: With dead ends: 494 [2025-03-16 21:54:13,842 INFO L226 Difference]: Without dead ends: 343 [2025-03-16 21:54:13,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:13,843 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 638 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:13,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 630 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-16 21:54:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 262. [2025-03-16 21:54:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.4789272030651341) internal successors, (386), 261 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 386 transitions. [2025-03-16 21:54:13,854 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 386 transitions. Word has length 71 [2025-03-16 21:54:13,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:13,854 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 386 transitions. [2025-03-16 21:54:13,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2025-03-16 21:54:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 21:54:13,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:13,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:13,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:54:13,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:13,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1476225317, now seen corresponding path program 1 times [2025-03-16 21:54:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:13,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736232048] [2025-03-16 21:54:13,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:13,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 21:54:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 21:54:13,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:14,027 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-16 21:54:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736232048] [2025-03-16 21:54:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736232048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662127639] [2025-03-16 21:54:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:14,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:14,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:14,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:14,029 INFO L87 Difference]: Start difference. First operand 262 states and 386 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:14,104 INFO L93 Difference]: Finished difference Result 415 states and 612 transitions. [2025-03-16 21:54:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 21:54:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:14,106 INFO L225 Difference]: With dead ends: 415 [2025-03-16 21:54:14,106 INFO L226 Difference]: Without dead ends: 264 [2025-03-16 21:54:14,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 21:54:14,108 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:14,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 634 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-16 21:54:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-16 21:54:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 388 transitions. [2025-03-16 21:54:14,117 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 388 transitions. Word has length 72 [2025-03-16 21:54:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:14,118 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 388 transitions. [2025-03-16 21:54:14,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 388 transitions. [2025-03-16 21:54:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 21:54:14,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:14,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:14,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:54:14,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:14,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 449853859, now seen corresponding path program 1 times [2025-03-16 21:54:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555783018] [2025-03-16 21:54:14,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:14,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 21:54:14,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 21:54:14,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:14,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:14,579 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-16 21:54:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555783018] [2025-03-16 21:54:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555783018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731668994] [2025-03-16 21:54:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:14,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:14,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:14,580 INFO L87 Difference]: Start difference. First operand 264 states and 388 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:14,726 INFO L93 Difference]: Finished difference Result 422 states and 621 transitions. [2025-03-16 21:54:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:14,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 21:54:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:14,728 INFO L225 Difference]: With dead ends: 422 [2025-03-16 21:54:14,728 INFO L226 Difference]: Without dead ends: 269 [2025-03-16 21:54:14,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:14,731 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:14,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1243 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-16 21:54:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-16 21:54:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4701492537313432) internal successors, (394), 268 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 394 transitions. [2025-03-16 21:54:14,740 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 394 transitions. Word has length 73 [2025-03-16 21:54:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:14,740 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 394 transitions. [2025-03-16 21:54:14,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 394 transitions. [2025-03-16 21:54:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 21:54:14,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:14,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:54:14,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1346036982, now seen corresponding path program 1 times [2025-03-16 21:54:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810373138] [2025-03-16 21:54:14,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:14,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 21:54:14,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 21:54:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:15,011 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-16 21:54:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810373138] [2025-03-16 21:54:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810373138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214780802] [2025-03-16 21:54:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:15,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:15,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:15,013 INFO L87 Difference]: Start difference. First operand 269 states and 394 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:15,160 INFO L93 Difference]: Finished difference Result 462 states and 676 transitions. [2025-03-16 21:54:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 21:54:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:15,162 INFO L225 Difference]: With dead ends: 462 [2025-03-16 21:54:15,162 INFO L226 Difference]: Without dead ends: 297 [2025-03-16 21:54:15,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:15,163 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 12 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:15,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1241 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-16 21:54:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-16 21:54:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4594594594594594) internal successors, (432), 296 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2025-03-16 21:54:15,172 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 74 [2025-03-16 21:54:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:15,174 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2025-03-16 21:54:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2025-03-16 21:54:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 21:54:15,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:15,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:54:15,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:15,176 INFO L85 PathProgramCache]: Analyzing trace with hash 139642863, now seen corresponding path program 1 times [2025-03-16 21:54:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:15,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528097098] [2025-03-16 21:54:15,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:15,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 21:54:15,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 21:54:15,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:15,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:15,643 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-16 21:54:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528097098] [2025-03-16 21:54:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528097098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488771937] [2025-03-16 21:54:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:15,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:15,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:15,645 INFO L87 Difference]: Start difference. First operand 297 states and 432 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:15,816 INFO L93 Difference]: Finished difference Result 490 states and 711 transitions. [2025-03-16 21:54:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 21:54:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:15,818 INFO L225 Difference]: With dead ends: 490 [2025-03-16 21:54:15,818 INFO L226 Difference]: Without dead ends: 313 [2025-03-16 21:54:15,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:15,820 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 212 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1000 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-16 21:54:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-16 21:54:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4487179487179487) internal successors, (452), 312 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 452 transitions. [2025-03-16 21:54:15,826 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 452 transitions. Word has length 74 [2025-03-16 21:54:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:15,827 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 452 transitions. [2025-03-16 21:54:15,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 452 transitions. [2025-03-16 21:54:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 21:54:15,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:15,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:15,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:54:15,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:15,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 979532520, now seen corresponding path program 1 times [2025-03-16 21:54:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74298877] [2025-03-16 21:54:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:15,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 21:54:15,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 21:54:15,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:15,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:16,280 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-16 21:54:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74298877] [2025-03-16 21:54:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74298877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:16,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:16,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793809706] [2025-03-16 21:54:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:16,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:16,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:16,281 INFO L87 Difference]: Start difference. First operand 313 states and 452 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:16,451 INFO L93 Difference]: Finished difference Result 528 states and 761 transitions. [2025-03-16 21:54:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 21:54:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:16,453 INFO L225 Difference]: With dead ends: 528 [2025-03-16 21:54:16,453 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 21:54:16,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:16,454 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 221 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:16,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1000 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 21:54:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-16 21:54:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.441358024691358) internal successors, (467), 324 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 467 transitions. [2025-03-16 21:54:16,465 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 467 transitions. Word has length 75 [2025-03-16 21:54:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:16,465 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 467 transitions. [2025-03-16 21:54:16,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 467 transitions. [2025-03-16 21:54:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 21:54:16,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:16,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:16,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:54:16,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -694379197, now seen corresponding path program 1 times [2025-03-16 21:54:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538576330] [2025-03-16 21:54:16,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:16,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 21:54:16,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 21:54:16,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:16,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:16,649 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-16 21:54:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:16,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538576330] [2025-03-16 21:54:16,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538576330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:16,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:16,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:16,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863648784] [2025-03-16 21:54:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:16,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:16,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:16,650 INFO L87 Difference]: Start difference. First operand 325 states and 467 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:16,788 INFO L93 Difference]: Finished difference Result 576 states and 823 transitions. [2025-03-16 21:54:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:16,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 21:54:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:16,790 INFO L225 Difference]: With dead ends: 576 [2025-03-16 21:54:16,790 INFO L226 Difference]: Without dead ends: 373 [2025-03-16 21:54:16,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:16,791 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 571 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:16,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-16 21:54:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 317. [2025-03-16 21:54:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4398734177215189) internal successors, (455), 316 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 455 transitions. [2025-03-16 21:54:16,798 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 455 transitions. Word has length 75 [2025-03-16 21:54:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:16,798 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 455 transitions. [2025-03-16 21:54:16,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 455 transitions. [2025-03-16 21:54:16,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 21:54:16,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:16,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:16,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:54:16,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:16,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1788352445, now seen corresponding path program 1 times [2025-03-16 21:54:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920803823] [2025-03-16 21:54:16,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:16,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 21:54:16,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 21:54:16,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:16,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,049 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-16 21:54:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920803823] [2025-03-16 21:54:17,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920803823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764699861] [2025-03-16 21:54:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:17,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:17,051 INFO L87 Difference]: Start difference. First operand 317 states and 455 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,205 INFO L93 Difference]: Finished difference Result 596 states and 851 transitions. [2025-03-16 21:54:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:17,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 21:54:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,206 INFO L225 Difference]: With dead ends: 596 [2025-03-16 21:54:17,206 INFO L226 Difference]: Without dead ends: 367 [2025-03-16 21:54:17,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:17,207 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 12 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1241 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-16 21:54:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-16 21:54:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.4234972677595628) internal successors, (521), 366 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 521 transitions. [2025-03-16 21:54:17,215 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 521 transitions. Word has length 75 [2025-03-16 21:54:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,215 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 521 transitions. [2025-03-16 21:54:17,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 521 transitions. [2025-03-16 21:54:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 21:54:17,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:54:17,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1366718230, now seen corresponding path program 1 times [2025-03-16 21:54:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949072686] [2025-03-16 21:54:17,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 21:54:17,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 21:54:17,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:17,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,404 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-16 21:54:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949072686] [2025-03-16 21:54:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949072686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307198541] [2025-03-16 21:54:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:17,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:17,407 INFO L87 Difference]: Start difference. First operand 367 states and 521 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,528 INFO L93 Difference]: Finished difference Result 648 states and 913 transitions. [2025-03-16 21:54:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:17,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 21:54:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,530 INFO L225 Difference]: With dead ends: 648 [2025-03-16 21:54:17,530 INFO L226 Difference]: Without dead ends: 389 [2025-03-16 21:54:17,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:17,531 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 536 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-16 21:54:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 341. [2025-03-16 21:54:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.4205882352941177) internal successors, (483), 340 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 483 transitions. [2025-03-16 21:54:17,538 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 483 transitions. Word has length 76 [2025-03-16 21:54:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 483 transitions. [2025-03-16 21:54:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2025-03-16 21:54:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 21:54:17,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:17,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:54:17,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1410133014, now seen corresponding path program 1 times [2025-03-16 21:54:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468292391] [2025-03-16 21:54:17,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 21:54:17,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 21:54:17,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:17,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:17,751 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-16 21:54:17,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:17,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468292391] [2025-03-16 21:54:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468292391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:17,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274840180] [2025-03-16 21:54:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:17,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:17,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:17,753 INFO L87 Difference]: Start difference. First operand 341 states and 483 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:17,923 INFO L93 Difference]: Finished difference Result 648 states and 917 transitions. [2025-03-16 21:54:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:17,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 21:54:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:17,926 INFO L225 Difference]: With dead ends: 648 [2025-03-16 21:54:17,926 INFO L226 Difference]: Without dead ends: 379 [2025-03-16 21:54:17,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:17,927 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 13 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:17,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1241 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-16 21:54:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-16 21:54:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.4153439153439153) internal successors, (535), 378 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 535 transitions. [2025-03-16 21:54:17,935 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 535 transitions. Word has length 76 [2025-03-16 21:54:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:17,935 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 535 transitions. [2025-03-16 21:54:17,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 535 transitions. [2025-03-16 21:54:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 21:54:17,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:17,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:54:17,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:17,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1170627663, now seen corresponding path program 1 times [2025-03-16 21:54:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:17,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392714347] [2025-03-16 21:54:17,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:17,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 21:54:18,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 21:54:18,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:18,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:18,345 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-16 21:54:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392714347] [2025-03-16 21:54:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392714347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:18,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:18,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405833466] [2025-03-16 21:54:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:18,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:18,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:18,347 INFO L87 Difference]: Start difference. First operand 379 states and 535 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:18,545 INFO L93 Difference]: Finished difference Result 671 states and 947 transitions. [2025-03-16 21:54:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 21:54:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:18,547 INFO L225 Difference]: With dead ends: 671 [2025-03-16 21:54:18,547 INFO L226 Difference]: Without dead ends: 403 [2025-03-16 21:54:18,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:18,548 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 230 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:18,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1000 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-16 21:54:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-16 21:54:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4104477611940298) internal successors, (567), 402 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 567 transitions. [2025-03-16 21:54:18,556 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 567 transitions. Word has length 76 [2025-03-16 21:54:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:18,556 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 567 transitions. [2025-03-16 21:54:18,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 567 transitions. [2025-03-16 21:54:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 21:54:18,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:18,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:18,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:54:18,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:18,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2010227313, now seen corresponding path program 1 times [2025-03-16 21:54:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715375754] [2025-03-16 21:54:18,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:18,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 21:54:18,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 21:54:18,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715375754] [2025-03-16 21:54:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715375754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:18,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:18,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930836534] [2025-03-16 21:54:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:18,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:18,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:18,746 INFO L87 Difference]: Start difference. First operand 403 states and 567 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:18,896 INFO L93 Difference]: Finished difference Result 788 states and 1107 transitions. [2025-03-16 21:54:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:54:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 21:54:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:18,897 INFO L225 Difference]: With dead ends: 788 [2025-03-16 21:54:18,898 INFO L226 Difference]: Without dead ends: 441 [2025-03-16 21:54:18,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:18,898 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 12 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1241 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-16 21:54:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-16 21:54:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.4045454545454545) internal successors, (618), 440 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 618 transitions. [2025-03-16 21:54:18,906 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 618 transitions. Word has length 77 [2025-03-16 21:54:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:18,907 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 618 transitions. [2025-03-16 21:54:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 618 transitions. [2025-03-16 21:54:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 21:54:18,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:18,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:18,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:54:18,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1900070407, now seen corresponding path program 1 times [2025-03-16 21:54:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569698349] [2025-03-16 21:54:18,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 21:54:18,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 21:54:18,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:18,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:19,051 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-16 21:54:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:19,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569698349] [2025-03-16 21:54:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569698349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599841896] [2025-03-16 21:54:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:19,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:19,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:19,053 INFO L87 Difference]: Start difference. First operand 441 states and 618 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:19,177 INFO L93 Difference]: Finished difference Result 793 states and 1102 transitions. [2025-03-16 21:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:19,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 21:54:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:19,179 INFO L225 Difference]: With dead ends: 793 [2025-03-16 21:54:19,179 INFO L226 Difference]: Without dead ends: 463 [2025-03-16 21:54:19,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:19,180 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 524 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:19,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-16 21:54:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 415. [2025-03-16 21:54:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.396135265700483) internal successors, (578), 414 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 578 transitions. [2025-03-16 21:54:19,187 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 578 transitions. Word has length 77 [2025-03-16 21:54:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:19,187 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 578 transitions. [2025-03-16 21:54:19,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 578 transitions. [2025-03-16 21:54:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 21:54:19,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:19,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:19,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:54:19,188 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1418049226, now seen corresponding path program 1 times [2025-03-16 21:54:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:19,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811346034] [2025-03-16 21:54:19,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:19,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 21:54:19,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 21:54:19,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:19,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:19,493 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-16 21:54:19,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811346034] [2025-03-16 21:54:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811346034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:54:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825602769] [2025-03-16 21:54:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:54:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:19,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:54:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:19,494 INFO L87 Difference]: Start difference. First operand 415 states and 578 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:19,662 INFO L93 Difference]: Finished difference Result 759 states and 1055 transitions. [2025-03-16 21:54:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 21:54:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:19,664 INFO L225 Difference]: With dead ends: 759 [2025-03-16 21:54:19,664 INFO L226 Difference]: Without dead ends: 439 [2025-03-16 21:54:19,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:19,665 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 238 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:19,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1000 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-16 21:54:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-16 21:54:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.3881278538812785) internal successors, (608), 438 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 608 transitions. [2025-03-16 21:54:19,674 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 608 transitions. Word has length 77 [2025-03-16 21:54:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:19,674 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 608 transitions. [2025-03-16 21:54:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 608 transitions. [2025-03-16 21:54:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 21:54:19,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:19,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:19,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:54:19,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:19,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 20782794, now seen corresponding path program 1 times [2025-03-16 21:54:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153987635] [2025-03-16 21:54:19,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:19,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 21:54:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 21:54:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:19,791 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-16 21:54:19,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:19,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153987635] [2025-03-16 21:54:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153987635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:19,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252210493] [2025-03-16 21:54:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:19,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:19,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:19,792 INFO L87 Difference]: Start difference. First operand 439 states and 608 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:19,883 INFO L93 Difference]: Finished difference Result 831 states and 1151 transitions. [2025-03-16 21:54:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 21:54:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:19,885 INFO L225 Difference]: With dead ends: 831 [2025-03-16 21:54:19,885 INFO L226 Difference]: Without dead ends: 471 [2025-03-16 21:54:19,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:19,886 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 12 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:19,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 843 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-16 21:54:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-16 21:54:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.3872340425531915) internal successors, (652), 470 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 652 transitions. [2025-03-16 21:54:19,893 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 652 transitions. Word has length 78 [2025-03-16 21:54:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:19,893 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 652 transitions. [2025-03-16 21:54:19,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 652 transitions. [2025-03-16 21:54:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 21:54:19,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:19,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:54:19,894 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1373669834, now seen corresponding path program 1 times [2025-03-16 21:54:19,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:19,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182425532] [2025-03-16 21:54:19,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:19,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:19,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 21:54:19,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 21:54:19,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:19,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:20,037 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-16 21:54:20,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182425532] [2025-03-16 21:54:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182425532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:20,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:20,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:20,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864306616] [2025-03-16 21:54:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:20,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:20,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:20,039 INFO L87 Difference]: Start difference. First operand 471 states and 652 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:20,158 INFO L93 Difference]: Finished difference Result 864 states and 1188 transitions. [2025-03-16 21:54:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:20,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 21:54:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:20,160 INFO L225 Difference]: With dead ends: 864 [2025-03-16 21:54:20,160 INFO L226 Difference]: Without dead ends: 485 [2025-03-16 21:54:20,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:20,161 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 489 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:20,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-16 21:54:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 445. [2025-03-16 21:54:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.382882882882883) internal successors, (614), 444 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 614 transitions. [2025-03-16 21:54:20,168 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 614 transitions. Word has length 78 [2025-03-16 21:54:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:20,168 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 614 transitions. [2025-03-16 21:54:20,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 614 transitions. [2025-03-16 21:54:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 21:54:20,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:20,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:20,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:54:20,169 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1605265989, now seen corresponding path program 1 times [2025-03-16 21:54:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472447727] [2025-03-16 21:54:20,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 21:54:20,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 21:54:20,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:20,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:20,393 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-16 21:54:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472447727] [2025-03-16 21:54:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472447727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110082979] [2025-03-16 21:54:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:20,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:20,395 INFO L87 Difference]: Start difference. First operand 445 states and 614 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:20,528 INFO L93 Difference]: Finished difference Result 838 states and 1156 transitions. [2025-03-16 21:54:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:20,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 21:54:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:20,530 INFO L225 Difference]: With dead ends: 838 [2025-03-16 21:54:20,530 INFO L226 Difference]: Without dead ends: 469 [2025-03-16 21:54:20,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:20,531 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 247 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:20,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 802 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-16 21:54:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-03-16 21:54:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.3803418803418803) internal successors, (646), 468 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 646 transitions. [2025-03-16 21:54:20,540 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 646 transitions. Word has length 78 [2025-03-16 21:54:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:20,540 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 646 transitions. [2025-03-16 21:54:20,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 646 transitions. [2025-03-16 21:54:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 21:54:20,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:20,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:20,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:54:20,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1476895655, now seen corresponding path program 1 times [2025-03-16 21:54:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999911343] [2025-03-16 21:54:20,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 21:54:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 21:54:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:20,715 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-16 21:54:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999911343] [2025-03-16 21:54:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999911343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814417788] [2025-03-16 21:54:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:20,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:20,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:20,716 INFO L87 Difference]: Start difference. First operand 469 states and 646 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:20,851 INFO L93 Difference]: Finished difference Result 895 states and 1222 transitions. [2025-03-16 21:54:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 21:54:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:20,853 INFO L225 Difference]: With dead ends: 895 [2025-03-16 21:54:20,853 INFO L226 Difference]: Without dead ends: 483 [2025-03-16 21:54:20,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:20,854 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 477 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:20,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-16 21:54:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 443. [2025-03-16 21:54:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3710407239819005) internal successors, (606), 442 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2025-03-16 21:54:20,865 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 79 [2025-03-16 21:54:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:20,865 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2025-03-16 21:54:20,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2025-03-16 21:54:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 21:54:20,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:20,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:20,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:54:20,866 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash -615779069, now seen corresponding path program 1 times [2025-03-16 21:54:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333767019] [2025-03-16 21:54:20,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:20,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 21:54:20,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 21:54:20,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:20,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:21,108 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-16 21:54:21,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333767019] [2025-03-16 21:54:21,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333767019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:21,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:21,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:21,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788160496] [2025-03-16 21:54:21,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:21,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:21,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:21,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:21,109 INFO L87 Difference]: Start difference. First operand 443 states and 606 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:21,243 INFO L93 Difference]: Finished difference Result 849 states and 1160 transitions. [2025-03-16 21:54:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 21:54:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:21,246 INFO L225 Difference]: With dead ends: 849 [2025-03-16 21:54:21,246 INFO L226 Difference]: Without dead ends: 455 [2025-03-16 21:54:21,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:21,248 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 253 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:21,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 802 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-16 21:54:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-16 21:54:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.3700440528634361) internal successors, (622), 454 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 622 transitions. [2025-03-16 21:54:21,256 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 622 transitions. Word has length 79 [2025-03-16 21:54:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:21,256 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 622 transitions. [2025-03-16 21:54:21,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 622 transitions. [2025-03-16 21:54:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 21:54:21,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:21,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:54:21,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:54:21,258 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:21,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash -883540320, now seen corresponding path program 1 times [2025-03-16 21:54:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:21,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470724239] [2025-03-16 21:54:21,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:21,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:21,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 21:54:21,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 21:54:21,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:21,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:21,386 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-16 21:54:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470724239] [2025-03-16 21:54:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470724239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705867046] [2025-03-16 21:54:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:21,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:21,387 INFO L87 Difference]: Start difference. First operand 455 states and 622 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:21,513 INFO L93 Difference]: Finished difference Result 836 states and 1143 transitions. [2025-03-16 21:54:21,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:21,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 21:54:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:21,515 INFO L225 Difference]: With dead ends: 836 [2025-03-16 21:54:21,515 INFO L226 Difference]: Without dead ends: 418 [2025-03-16 21:54:21,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:21,516 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 427 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:21,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 615 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-16 21:54:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 397. [2025-03-16 21:54:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3838383838383839) internal successors, (548), 396 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 548 transitions. [2025-03-16 21:54:21,523 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 548 transitions. Word has length 80 [2025-03-16 21:54:21,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:21,523 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 548 transitions. [2025-03-16 21:54:21,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 548 transitions. [2025-03-16 21:54:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 21:54:21,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:21,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:54:21,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:54:21,524 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:21,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash -308461507, now seen corresponding path program 1 times [2025-03-16 21:54:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453994754] [2025-03-16 21:54:21,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 21:54:21,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 21:54:21,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:21,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453994754] [2025-03-16 21:54:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453994754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160459876] [2025-03-16 21:54:22,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:22,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:22,758 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-16 21:54:22,760 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-16 21:54:22,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 21:54:23,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 21:54:23,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:23,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-16 21:54:23,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:23,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:24,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160459876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:24,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 30 [2025-03-16 21:54:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384575236] [2025-03-16 21:54:24,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 21:54:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:24,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 21:54:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2025-03-16 21:54:24,424 INFO L87 Difference]: Start difference. First operand 397 states and 548 transitions. Second operand has 30 states, 30 states have (on average 13.6) internal successors, (408), 30 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:26,919 INFO L93 Difference]: Finished difference Result 2045 states and 2823 transitions. [2025-03-16 21:54:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-16 21:54:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 13.6) internal successors, (408), 30 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 21:54:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:26,924 INFO L225 Difference]: With dead ends: 2045 [2025-03-16 21:54:26,924 INFO L226 Difference]: Without dead ends: 1689 [2025-03-16 21:54:26,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1169, Invalid=5803, Unknown=0, NotChecked=0, Total=6972 [2025-03-16 21:54:26,927 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 3351 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3351 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:26,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3351 Valid, 1984 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 21:54:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2025-03-16 21:54:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 719. [2025-03-16 21:54:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.3704735376044568) internal successors, (984), 718 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 984 transitions. [2025-03-16 21:54:26,942 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 984 transitions. Word has length 150 [2025-03-16 21:54:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 984 transitions. [2025-03-16 21:54:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.6) internal successors, (408), 30 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 984 transitions. [2025-03-16 21:54:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 21:54:26,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:26,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:26,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 21:54:27,149 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,SelfDestructingSolverStorable23 [2025-03-16 21:54:27,150 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1711156016, now seen corresponding path program 1 times [2025-03-16 21:54:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638195917] [2025-03-16 21:54:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:27,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 21:54:27,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 21:54:27,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:27,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638195917] [2025-03-16 21:54:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638195917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530760983] [2025-03-16 21:54:28,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:28,251 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-16 21:54:28,252 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-16 21:54:28,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 21:54:28,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 21:54:28,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 21:54:28,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:29,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:29,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530760983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:29,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2025-03-16 21:54:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768184162] [2025-03-16 21:54:29,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:29,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 21:54:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 21:54:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:54:29,366 INFO L87 Difference]: Start difference. First operand 719 states and 984 transitions. Second operand has 24 states, 24 states have (on average 16.208333333333332) internal successors, (389), 24 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:30,933 INFO L93 Difference]: Finished difference Result 4149 states and 5690 transitions. [2025-03-16 21:54:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-16 21:54:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 16.208333333333332) internal successors, (389), 24 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-03-16 21:54:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:30,942 INFO L225 Difference]: With dead ends: 4149 [2025-03-16 21:54:30,942 INFO L226 Difference]: Without dead ends: 3507 [2025-03-16 21:54:30,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=647, Invalid=2323, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 21:54:30,944 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 4410 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:30,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 2190 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 21:54:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2025-03-16 21:54:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 1385. [2025-03-16 21:54:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1384 states have (on average 1.3641618497109826) internal successors, (1888), 1384 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1888 transitions. [2025-03-16 21:54:30,975 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1888 transitions. Word has length 151 [2025-03-16 21:54:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:30,975 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1888 transitions. [2025-03-16 21:54:30,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 16.208333333333332) internal successors, (389), 24 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1888 transitions. [2025-03-16 21:54:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 21:54:30,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:30,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 21:54:30,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:54:31,179 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,SelfDestructingSolverStorable24 [2025-03-16 21:54:31,179 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash 465883445, now seen corresponding path program 1 times [2025-03-16 21:54:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993759778] [2025-03-16 21:54:31,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:31,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 21:54:31,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 21:54:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 21:54:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993759778] [2025-03-16 21:54:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993759778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69010203] [2025-03-16 21:54:32,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:32,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:32,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:32,055 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-16 21:54:32,057 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-16 21:54:32,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 21:54:32,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 21:54:32,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:32,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:32,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 197 conjuncts are in the unsatisfiable core [2025-03-16 21:54:32,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:34,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69010203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:36,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 23, 23] total 48 [2025-03-16 21:54:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175428325] [2025-03-16 21:54:36,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-16 21:54:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:36,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-16 21:54:36,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2032, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 21:54:36,541 INFO L87 Difference]: Start difference. First operand 1385 states and 1888 transitions. Second operand has 49 states, 49 states have (on average 8.224489795918368) internal successors, (403), 48 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:39,879 INFO L93 Difference]: Finished difference Result 4141 states and 5648 transitions. [2025-03-16 21:54:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-16 21:54:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 8.224489795918368) internal successors, (403), 48 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-16 21:54:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:39,885 INFO L225 Difference]: With dead ends: 4141 [2025-03-16 21:54:39,885 INFO L226 Difference]: Without dead ends: 2833 [2025-03-16 21:54:39,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2803 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1194, Invalid=8906, Unknown=0, NotChecked=0, Total=10100 [2025-03-16 21:54:39,888 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 2600 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 5231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:39,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 2854 Invalid, 5231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 21:54:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2025-03-16 21:54:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 1954. [2025-03-16 21:54:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 1.3691756272401434) internal successors, (2674), 1953 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2674 transitions. [2025-03-16 21:54:39,916 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2674 transitions. Word has length 152 [2025-03-16 21:54:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 1954 states and 2674 transitions. [2025-03-16 21:54:39,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 8.224489795918368) internal successors, (403), 48 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2674 transitions. [2025-03-16 21:54:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 21:54:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:39,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:54:39,931 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-16 21:54:40,121 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-16 21:54:40,121 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 290445991, now seen corresponding path program 1 times [2025-03-16 21:54:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324719818] [2025-03-16 21:54:40,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:40,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324719818] [2025-03-16 21:54:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324719818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694692227] [2025-03-16 21:54:41,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:41,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:41,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:41,142 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-16 21:54:41,145 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-16 21:54:41,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:41,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:41,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:41,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:41,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-16 21:54:41,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:42,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 21:54:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694692227] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:54:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 14] total 34 [2025-03-16 21:54:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995678407] [2025-03-16 21:54:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:42,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 21:54:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:42,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 21:54:42,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 21:54:42,571 INFO L87 Difference]: Start difference. First operand 1954 states and 2674 transitions. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:43,567 INFO L93 Difference]: Finished difference Result 5446 states and 7452 transitions. [2025-03-16 21:54:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 21:54:43,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 21:54:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:43,577 INFO L225 Difference]: With dead ends: 5446 [2025-03-16 21:54:43,577 INFO L226 Difference]: Without dead ends: 4138 [2025-03-16 21:54:43,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 21:54:43,583 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1401 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:43,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 1880 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:54:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2025-03-16 21:54:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 3868. [2025-03-16 21:54:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3868 states, 3867 states have (on average 1.3685027152831652) internal successors, (5292), 3867 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5292 transitions. [2025-03-16 21:54:43,628 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5292 transitions. Word has length 153 [2025-03-16 21:54:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:43,629 INFO L471 AbstractCegarLoop]: Abstraction has 3868 states and 5292 transitions. [2025-03-16 21:54:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5292 transitions. [2025-03-16 21:54:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 21:54:43,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:43,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:43,645 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-16 21:54:43,836 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-16 21:54:43,836 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1853810338, now seen corresponding path program 1 times [2025-03-16 21:54:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539500268] [2025-03-16 21:54:43,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:43,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:44,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:44,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:44,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 21:54:44,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539500268] [2025-03-16 21:54:44,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539500268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858758173] [2025-03-16 21:54:44,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:44,820 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-16 21:54:44,822 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-16 21:54:45,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:45,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:45,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:45,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:45,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-16 21:54:45,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:46,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858758173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:48,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24, 20] total 51 [2025-03-16 21:54:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819179761] [2025-03-16 21:54:48,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:48,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 21:54:48,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:48,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 21:54:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2382, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 21:54:48,010 INFO L87 Difference]: Start difference. First operand 3868 states and 5292 transitions. Second operand has 52 states, 52 states have (on average 7.980769230769231) internal successors, (415), 51 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:52,074 INFO L93 Difference]: Finished difference Result 8434 states and 11486 transitions. [2025-03-16 21:54:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-16 21:54:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 7.980769230769231) internal successors, (415), 51 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 21:54:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:52,085 INFO L225 Difference]: With dead ends: 8434 [2025-03-16 21:54:52,086 INFO L226 Difference]: Without dead ends: 5785 [2025-03-16 21:54:52,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4204 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1534, Invalid=14978, Unknown=0, NotChecked=0, Total=16512 [2025-03-16 21:54:52,091 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 2762 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 6824 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 6854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:52,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 3023 Invalid, 6854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6824 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 21:54:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5785 states. [2025-03-16 21:54:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5414. [2025-03-16 21:54:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5414 states, 5413 states have (on average 1.3589506743026047) internal successors, (7356), 5413 states have internal predecessors, (7356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 7356 transitions. [2025-03-16 21:54:52,168 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 7356 transitions. Word has length 153 [2025-03-16 21:54:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:52,169 INFO L471 AbstractCegarLoop]: Abstraction has 5414 states and 7356 transitions. [2025-03-16 21:54:52,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.980769230769231) internal successors, (415), 51 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 7356 transitions. [2025-03-16 21:54:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 21:54:52,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:52,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:52,187 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-16 21:54:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 21:54:52,378 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:52,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 886837144, now seen corresponding path program 1 times [2025-03-16 21:54:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991963112] [2025-03-16 21:54:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:52,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:52,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991963112] [2025-03-16 21:54:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991963112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133893862] [2025-03-16 21:54:52,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:52,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:52,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:52,815 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-16 21:54:52,816 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-16 21:54:53,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 21:54:53,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 21:54:53,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:53,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:53,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 21:54:53,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:53,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133893862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:53,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-16 21:54:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570364799] [2025-03-16 21:54:53,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 21:54:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 21:54:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:54:53,811 INFO L87 Difference]: Start difference. First operand 5414 states and 7356 transitions. Second operand has 18 states, 18 states have (on average 19.166666666666668) internal successors, (345), 18 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:54,577 INFO L93 Difference]: Finished difference Result 16387 states and 22099 transitions. [2025-03-16 21:54:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 21:54:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.166666666666668) internal successors, (345), 18 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-16 21:54:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:54,593 INFO L225 Difference]: With dead ends: 16387 [2025-03-16 21:54:54,594 INFO L226 Difference]: Without dead ends: 9844 [2025-03-16 21:54:54,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2025-03-16 21:54:54,600 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1442 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:54,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 1730 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:54:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9844 states. [2025-03-16 21:54:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9844 to 9140. [2025-03-16 21:54:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9140 states, 9139 states have (on average 1.3259656417551153) internal successors, (12118), 9139 states have internal predecessors, (12118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9140 states to 9140 states and 12118 transitions. [2025-03-16 21:54:54,749 INFO L78 Accepts]: Start accepts. Automaton has 9140 states and 12118 transitions. Word has length 153 [2025-03-16 21:54:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:54,749 INFO L471 AbstractCegarLoop]: Abstraction has 9140 states and 12118 transitions. [2025-03-16 21:54:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.166666666666668) internal successors, (345), 18 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 9140 states and 12118 transitions. [2025-03-16 21:54:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 21:54:54,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:54,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:54:54,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 21:54:54,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 21:54:54,964 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:54,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1389005239, now seen corresponding path program 1 times [2025-03-16 21:54:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029574550] [2025-03-16 21:54:54,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 21:54:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 21:54:55,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:55,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:55,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:55,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029574550] [2025-03-16 21:54:55,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029574550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:55,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600193189] [2025-03-16 21:54:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:55,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:55,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:55,679 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-16 21:54:55,680 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-16 21:54:55,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-16 21:54:56,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-16 21:54:56,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:56,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:56,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 21:54:56,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:56,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600193189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:57,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:57,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 27 [2025-03-16 21:54:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688539023] [2025-03-16 21:54:57,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:57,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 21:54:57,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:57,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 21:54:57,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2025-03-16 21:54:57,051 INFO L87 Difference]: Start difference. First operand 9140 states and 12118 transitions. Second operand has 27 states, 27 states have (on average 15.25925925925926) internal successors, (412), 27 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:55:01,644 INFO L93 Difference]: Finished difference Result 36460 states and 48384 transitions. [2025-03-16 21:55:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-16 21:55:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.25925925925926) internal successors, (412), 27 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-16 21:55:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:55:01,688 INFO L225 Difference]: With dead ends: 36460 [2025-03-16 21:55:01,688 INFO L226 Difference]: Without dead ends: 31005 [2025-03-16 21:55:01,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1075, Invalid=5087, Unknown=0, NotChecked=0, Total=6162 [2025-03-16 21:55:01,698 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1503 mSDsluCounter, 8639 mSDsCounter, 0 mSdLazyCounter, 10912 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 9290 SdHoareTripleChecker+Invalid, 10919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:55:01,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 9290 Invalid, 10919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10912 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 21:55:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31005 states. [2025-03-16 21:55:01,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31005 to 20309. [2025-03-16 21:55:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20309 states, 20308 states have (on average 1.3163285404766594) internal successors, (26732), 20308 states have internal predecessors, (26732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 26732 transitions. [2025-03-16 21:55:02,033 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 26732 transitions. Word has length 154 [2025-03-16 21:55:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:55:02,033 INFO L471 AbstractCegarLoop]: Abstraction has 20309 states and 26732 transitions. [2025-03-16 21:55:02,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.25925925925926) internal successors, (412), 27 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 26732 transitions. [2025-03-16 21:55:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 21:55:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:55:02,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:55:02,071 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-16 21:55:02,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:02,261 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:55:02,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:55:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -166107174, now seen corresponding path program 1 times [2025-03-16 21:55:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:55:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227529116] [2025-03-16 21:55:02,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:55:02,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 21:55:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 21:55:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 21:55:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:55:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227529116] [2025-03-16 21:55:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227529116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:55:02,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:55:02,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:55:02,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494843517] [2025-03-16 21:55:02,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:55:02,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:55:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:55:02,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:55:02,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:55:02,996 INFO L87 Difference]: Start difference. First operand 20309 states and 26732 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:55:03,318 INFO L93 Difference]: Finished difference Result 52269 states and 68326 transitions. [2025-03-16 21:55:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:55:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-16 21:55:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:55:03,377 INFO L225 Difference]: With dead ends: 52269 [2025-03-16 21:55:03,378 INFO L226 Difference]: Without dead ends: 34261 [2025-03-16 21:55:03,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:55:03,401 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 296 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:55:03,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 490 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:55:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34261 states. [2025-03-16 21:55:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34261 to 22229. [2025-03-16 21:55:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22229 states, 22228 states have (on average 1.3084398056505309) internal successors, (29084), 22228 states have internal predecessors, (29084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22229 states to 22229 states and 29084 transitions. [2025-03-16 21:55:03,685 INFO L78 Accepts]: Start accepts. Automaton has 22229 states and 29084 transitions. Word has length 155 [2025-03-16 21:55:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:55:03,686 INFO L471 AbstractCegarLoop]: Abstraction has 22229 states and 29084 transitions. [2025-03-16 21:55:03,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22229 states and 29084 transitions. [2025-03-16 21:55:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 21:55:03,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:55:03,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:55:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 21:55:03,711 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:55:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:55:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1465419896, now seen corresponding path program 1 times [2025-03-16 21:55:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:55:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249152600] [2025-03-16 21:55:03,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:55:03,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 21:55:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 21:55:04,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:55:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249152600] [2025-03-16 21:55:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249152600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:55:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674568911] [2025-03-16 21:55:05,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:55:05,392 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-16 21:55:05,393 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-16 21:55:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 21:55:06,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 21:55:06,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:06,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:06,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-16 21:55:06,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:55:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:07,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:55:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674568911] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:55:09,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:55:09,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 21] total 39 [2025-03-16 21:55:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226079974] [2025-03-16 21:55:09,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:55:09,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 21:55:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:55:09,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 21:55:09,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 21:55:09,033 INFO L87 Difference]: Start difference. First operand 22229 states and 29084 transitions. Second operand has 40 states, 40 states have (on average 10.725) internal successors, (429), 39 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:55:11,187 INFO L93 Difference]: Finished difference Result 37645 states and 49210 transitions. [2025-03-16 21:55:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 21:55:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 10.725) internal successors, (429), 39 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-16 21:55:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:55:11,206 INFO L225 Difference]: With dead ends: 37645 [2025-03-16 21:55:11,206 INFO L226 Difference]: Without dead ends: 17717 [2025-03-16 21:55:11,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=677, Invalid=5175, Unknown=0, NotChecked=0, Total=5852 [2025-03-16 21:55:11,223 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1748 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 3619 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:55:11,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2363 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3619 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 21:55:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17717 states. [2025-03-16 21:55:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17717 to 17145. [2025-03-16 21:55:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17145 states, 17144 states have (on average 1.3058796080261317) internal successors, (22388), 17144 states have internal predecessors, (22388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17145 states to 17145 states and 22388 transitions. [2025-03-16 21:55:11,421 INFO L78 Accepts]: Start accepts. Automaton has 17145 states and 22388 transitions. Word has length 155 [2025-03-16 21:55:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:55:11,421 INFO L471 AbstractCegarLoop]: Abstraction has 17145 states and 22388 transitions. [2025-03-16 21:55:11,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 10.725) internal successors, (429), 39 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 17145 states and 22388 transitions. [2025-03-16 21:55:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 21:55:11,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:55:11,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:55:11,449 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-16 21:55:11,638 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,SelfDestructingSolverStorable31 [2025-03-16 21:55:11,638 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:55:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:55:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 378024417, now seen corresponding path program 1 times [2025-03-16 21:55:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:55:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395052956] [2025-03-16 21:55:11,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:55:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:11,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:11,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:11,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:55:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395052956] [2025-03-16 21:55:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395052956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:55:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99378611] [2025-03-16 21:55:13,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:13,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:55:13,543 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-16 21:55:13,543 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-16 21:55:13,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:14,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:14,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:14,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:14,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-16 21:55:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:55:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:15,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:55:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99378611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:55:17,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:55:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 18] total 39 [2025-03-16 21:55:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493664132] [2025-03-16 21:55:17,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:55:17,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 21:55:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:55:17,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 21:55:17,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 21:55:17,113 INFO L87 Difference]: Start difference. First operand 17145 states and 22388 transitions. Second operand has 40 states, 40 states have (on average 9.525) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:55:20,952 INFO L93 Difference]: Finished difference Result 52495 states and 68822 transitions. [2025-03-16 21:55:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 21:55:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 9.525) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-03-16 21:55:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:55:20,988 INFO L225 Difference]: With dead ends: 52495 [2025-03-16 21:55:20,988 INFO L226 Difference]: Without dead ends: 31039 [2025-03-16 21:55:21,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1415, Invalid=10575, Unknown=0, NotChecked=0, Total=11990 [2025-03-16 21:55:21,009 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1689 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:55:21,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3160 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 21:55:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31039 states. [2025-03-16 21:55:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31039 to 27012. [2025-03-16 21:55:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27012 states, 27011 states have (on average 1.30391322053978) internal successors, (35220), 27011 states have internal predecessors, (35220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27012 states to 27012 states and 35220 transitions. [2025-03-16 21:55:21,296 INFO L78 Accepts]: Start accepts. Automaton has 27012 states and 35220 transitions. Word has length 156 [2025-03-16 21:55:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:55:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 27012 states and 35220 transitions. [2025-03-16 21:55:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.525) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27012 states and 35220 transitions. [2025-03-16 21:55:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 21:55:21,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:55:21,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:55:21,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 21:55:21,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:21,504 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:55:21,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:55:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2134235568, now seen corresponding path program 1 times [2025-03-16 21:55:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:55:21,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050536313] [2025-03-16 21:55:21,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:55:21,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:21,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:21,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:21,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:22,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:55:22,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050536313] [2025-03-16 21:55:22,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050536313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:55:22,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867469299] [2025-03-16 21:55:22,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:22,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:22,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:55:22,250 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-16 21:55:22,252 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-16 21:55:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:22,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:22,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:22,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:22,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 21:55:22,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:55:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:23,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:55:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867469299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:55:23,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:55:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-03-16 21:55:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674360397] [2025-03-16 21:55:23,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:55:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 21:55:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:55:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 21:55:23,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:55:23,597 INFO L87 Difference]: Start difference. First operand 27012 states and 35220 transitions. Second operand has 21 states, 21 states have (on average 17.428571428571427) internal successors, (366), 20 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:55:24,645 INFO L93 Difference]: Finished difference Result 49484 states and 64532 transitions. [2025-03-16 21:55:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 21:55:24,646 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 17.428571428571427) internal successors, (366), 20 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-03-16 21:55:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:55:24,671 INFO L225 Difference]: With dead ends: 49484 [2025-03-16 21:55:24,671 INFO L226 Difference]: Without dead ends: 24093 [2025-03-16 21:55:24,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2025-03-16 21:55:24,690 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1544 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:55:24,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 2064 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:55:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24093 states. [2025-03-16 21:55:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24093 to 22034. [2025-03-16 21:55:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22034 states, 22033 states have (on average 1.3005945627014024) internal successors, (28656), 22033 states have internal predecessors, (28656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22034 states to 22034 states and 28656 transitions. [2025-03-16 21:55:24,892 INFO L78 Accepts]: Start accepts. Automaton has 22034 states and 28656 transitions. Word has length 156 [2025-03-16 21:55:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:55:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 22034 states and 28656 transitions. [2025-03-16 21:55:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 17.428571428571427) internal successors, (366), 20 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:55:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22034 states and 28656 transitions. [2025-03-16 21:55:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 21:55:24,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:55:24,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 21:55:24,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 21:55:25,099 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,SelfDestructingSolverStorable33 [2025-03-16 21:55:25,100 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:55:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:55:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -793088831, now seen corresponding path program 1 times [2025-03-16 21:55:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:55:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157306151] [2025-03-16 21:55:25,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:55:25,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:25,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:25,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:25,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:55:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:55:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157306151] [2025-03-16 21:55:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157306151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:55:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599114439] [2025-03-16 21:55:26,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:55:26,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:55:26,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:55:26,618 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-16 21:55:26,619 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-16 21:55:27,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 21:55:27,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 21:55:27,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:55:27,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:55:27,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 195 conjuncts are in the unsatisfiable core [2025-03-16 21:55:27,374 INFO L279 TraceCheckSpWp]: Computing forward predicates...