./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a50f9ed11f10306280cf680a91856fa84d69e79835a7539c0719fe95b31ba9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:13:02,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:13:02,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:13:02,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:13:02,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:13:02,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:13:02,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:13:02,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:13:02,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:13:02,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:13:02,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:13:02,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:13:02,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:13:02,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:13:02,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:13:02,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:13:02,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:13:02,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:13:02,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:13:02,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:13:02,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:13:02,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a50f9ed11f10306280cf680a91856fa84d69e79835a7539c0719fe95b31ba9a8 [2025-03-08 14:13:02,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:13:02,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:13:02,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:13:02,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:13:02,413 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:13:02,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-08 14:13:03,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a14c2c7b/94038f0175c74493ab28216ecb3fdaa5/FLAG2c623af50 [2025-03-08 14:13:03,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:13:03,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-08 14:13:03,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a14c2c7b/94038f0175c74493ab28216ecb3fdaa5/FLAG2c623af50 [2025-03-08 14:13:04,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a14c2c7b/94038f0175c74493ab28216ecb3fdaa5 [2025-03-08 14:13:04,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:13:04,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:13:04,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:13:04,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:13:04,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:13:04,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04, skipping insertion in model container [2025-03-08 14:13:04,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:13:04,245 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i[916,929] [2025-03-08 14:13:04,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:13:04,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:13:04,327 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i[916,929] [2025-03-08 14:13:04,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:13:04,378 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:13:04,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04 WrapperNode [2025-03-08 14:13:04,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:13:04,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:13:04,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:13:04,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:13:04,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,443 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2025-03-08 14:13:04,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:13:04,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:13:04,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:13:04,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:13:04,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:13:04,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:13:04,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:13:04,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:13:04,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:13:04,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (1/1) ... [2025-03-08 14:13:04,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:13:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:04,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:13:04,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:13:04,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:13:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:13:04,638 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:13:04,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:13:05,114 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~bitwise43#1;havoc property_#t~short44#1; [2025-03-08 14:13:05,172 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-08 14:13:05,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:13:05,194 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:13:05,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:13:05,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:13:05 BoogieIcfgContainer [2025-03-08 14:13:05,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:13:05,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:13:05,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:13:05,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:13:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:13:04" (1/3) ... [2025-03-08 14:13:05,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f5958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:13:05, skipping insertion in model container [2025-03-08 14:13:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:13:04" (2/3) ... [2025-03-08 14:13:05,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f5958f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:13:05, skipping insertion in model container [2025-03-08 14:13:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:13:05" (3/3) ... [2025-03-08 14:13:05,204 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-08 14:13:05,214 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:13:05,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-68.i that has 2 procedures, 162 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:13:05,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:13:05,266 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;@59151a39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:13:05,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:13:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 14:13:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 14:13:05,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:05,282 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:05,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2112434822, now seen corresponding path program 1 times [2025-03-08 14:13:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661536670] [2025-03-08 14:13:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:05,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 14:13:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 14:13:05,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-08 14:13:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:05,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661536670] [2025-03-08 14:13:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661536670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:05,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524838646] [2025-03-08 14:13:05,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:05,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:05,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:13:05,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 14:13:05,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 14:13:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:13:05,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-08 14:13:05,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:13:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524838646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:05,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:13:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:13:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192429145] [2025-03-08 14:13:05,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:05,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:13:05,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:05,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:13:05,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:13:05,950 INFO L87 Difference]: Start difference. First operand has 162 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 14:13:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:05,999 INFO L93 Difference]: Finished difference Result 318 states and 541 transitions. [2025-03-08 14:13:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:13:06,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 269 [2025-03-08 14:13:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:06,007 INFO L225 Difference]: With dead ends: 318 [2025-03-08 14:13:06,007 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 14:13:06,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:13:06,012 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:06,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:13:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 14:13:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-08 14:13:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.435897435897436) internal successors, (168), 117 states have internal predecessors, (168), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 14:13:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-03-08 14:13:06,049 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 269 [2025-03-08 14:13:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:06,050 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-03-08 14:13:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 14:13:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-03-08 14:13:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 14:13:06,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:06,055 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:06,063 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-08 14:13:06,256 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,SelfDestructingSolverStorable0 [2025-03-08 14:13:06,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2079483428, now seen corresponding path program 1 times [2025-03-08 14:13:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132752573] [2025-03-08 14:13:06,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:06,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 14:13:06,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 14:13:06,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:06,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:08,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:08,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132752573] [2025-03-08 14:13:08,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132752573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:08,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 14:13:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787347870] [2025-03-08 14:13:08,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:08,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:13:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:08,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:13:08,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:13:08,252 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 14:13:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:09,255 INFO L93 Difference]: Finished difference Result 633 states and 980 transitions. [2025-03-08 14:13:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:13:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 269 [2025-03-08 14:13:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:09,260 INFO L225 Difference]: With dead ends: 633 [2025-03-08 14:13:09,261 INFO L226 Difference]: Without dead ends: 477 [2025-03-08 14:13:09,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:13:09,263 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 866 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:09,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 740 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:13:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-08 14:13:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 450. [2025-03-08 14:13:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 363 states have (on average 1.4710743801652892) internal successors, (534), 364 states have internal predecessors, (534), 83 states have call successors, (83), 3 states have call predecessors, (83), 3 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 14:13:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 700 transitions. [2025-03-08 14:13:09,329 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 700 transitions. Word has length 269 [2025-03-08 14:13:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 700 transitions. [2025-03-08 14:13:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-08 14:13:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 700 transitions. [2025-03-08 14:13:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-08 14:13:09,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:09,337 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:09,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:13:09,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash -862174171, now seen corresponding path program 1 times [2025-03-08 14:13:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122811893] [2025-03-08 14:13:09,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:09,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:09,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 14:13:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 14:13:09,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122811893] [2025-03-08 14:13:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122811893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981967336] [2025-03-08 14:13:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:09,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:09,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:09,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:09,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:13:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 14:13:09,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 14:13:09,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:09,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 14:13:09,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1543 proven. 147 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2025-03-08 14:13:10,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 81 proven. 150 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2025-03-08 14:13:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981967336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:10,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-08 14:13:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554011395] [2025-03-08 14:13:10,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 14:13:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:10,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 14:13:10,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:13:10,888 INFO L87 Difference]: Start difference. First operand 450 states and 700 transitions. Second operand has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 15 states have internal predecessors, (140), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-08 14:13:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:11,467 INFO L93 Difference]: Finished difference Result 875 states and 1344 transitions. [2025-03-08 14:13:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 14:13:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 15 states have internal predecessors, (140), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) Word has length 269 [2025-03-08 14:13:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:11,473 INFO L225 Difference]: With dead ends: 875 [2025-03-08 14:13:11,473 INFO L226 Difference]: Without dead ends: 428 [2025-03-08 14:13:11,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:13:11,476 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 540 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:11,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 465 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:13:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-08 14:13:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 424. [2025-03-08 14:13:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 331 states have (on average 1.353474320241692) internal successors, (448), 332 states have internal predecessors, (448), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 14:13:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 614 transitions. [2025-03-08 14:13:11,519 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 614 transitions. Word has length 269 [2025-03-08 14:13:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:11,520 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 614 transitions. [2025-03-08 14:13:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.333333333333334) internal successors, (140), 15 states have internal predecessors, (140), 6 states have call successors, (102), 3 states have call predecessors, (102), 7 states have return successors, (104), 6 states have call predecessors, (104), 6 states have call successors, (104) [2025-03-08 14:13:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 614 transitions. [2025-03-08 14:13:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 14:13:11,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:11,522 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:11,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:13:11,722 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,SelfDestructingSolverStorable2 [2025-03-08 14:13:11,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -15249832, now seen corresponding path program 1 times [2025-03-08 14:13:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:11,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080409679] [2025-03-08 14:13:11,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:11,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:11,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080409679] [2025-03-08 14:13:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080409679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 14:13:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374604354] [2025-03-08 14:13:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:13:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:13,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:13:13,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:13:13,671 INFO L87 Difference]: Start difference. First operand 424 states and 614 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:15,169 INFO L93 Difference]: Finished difference Result 1035 states and 1475 transitions. [2025-03-08 14:13:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 14:13:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 271 [2025-03-08 14:13:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:15,173 INFO L225 Difference]: With dead ends: 1035 [2025-03-08 14:13:15,174 INFO L226 Difference]: Without dead ends: 614 [2025-03-08 14:13:15,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-08 14:13:15,177 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 909 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:15,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1170 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 14:13:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-08 14:13:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 459. [2025-03-08 14:13:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 366 states have (on average 1.366120218579235) internal successors, (500), 367 states have internal predecessors, (500), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 14:13:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 666 transitions. [2025-03-08 14:13:15,208 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 666 transitions. Word has length 271 [2025-03-08 14:13:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:15,209 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 666 transitions. [2025-03-08 14:13:15,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 666 transitions. [2025-03-08 14:13:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 14:13:15,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:15,211 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:13:15,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1492301977, now seen corresponding path program 1 times [2025-03-08 14:13:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843328187] [2025-03-08 14:13:15,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:15,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:15,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:15,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:15,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:15,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843328187] [2025-03-08 14:13:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843328187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:16,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 14:13:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803535591] [2025-03-08 14:13:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:16,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 14:13:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:16,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 14:13:16,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:13:16,361 INFO L87 Difference]: Start difference. First operand 459 states and 666 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:17,750 INFO L93 Difference]: Finished difference Result 1060 states and 1522 transitions. [2025-03-08 14:13:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:13:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 271 [2025-03-08 14:13:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:17,756 INFO L225 Difference]: With dead ends: 1060 [2025-03-08 14:13:17,756 INFO L226 Difference]: Without dead ends: 598 [2025-03-08 14:13:17,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:13:17,759 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1076 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:17,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 909 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 14:13:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-08 14:13:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 491. [2025-03-08 14:13:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 398 states have (on average 1.3668341708542713) internal successors, (544), 399 states have internal predecessors, (544), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-08 14:13:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 710 transitions. [2025-03-08 14:13:17,783 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 710 transitions. Word has length 271 [2025-03-08 14:13:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:17,783 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 710 transitions. [2025-03-08 14:13:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 710 transitions. [2025-03-08 14:13:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 14:13:17,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:17,786 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:17,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:13:17,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:17,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1449355622, now seen corresponding path program 1 times [2025-03-08 14:13:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220745659] [2025-03-08 14:13:17,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:17,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:17,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:17,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:17,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220745659] [2025-03-08 14:13:18,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220745659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:18,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322452387] [2025-03-08 14:13:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:18,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:18,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:18,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:18,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:13:18,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:18,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:18,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:18,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:18,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 14:13:18,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 515 proven. 210 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2025-03-08 14:13:19,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322452387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:20,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 20 [2025-03-08 14:13:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724150558] [2025-03-08 14:13:20,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 14:13:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:20,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 14:13:20,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-08 14:13:20,365 INFO L87 Difference]: Start difference. First operand 491 states and 710 transitions. Second operand has 20 states, 20 states have (on average 9.6) internal successors, (192), 19 states have internal predecessors, (192), 6 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (117), 6 states have call predecessors, (117), 6 states have call successors, (117) [2025-03-08 14:13:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:22,866 INFO L93 Difference]: Finished difference Result 1501 states and 2147 transitions. [2025-03-08 14:13:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-08 14:13:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.6) internal successors, (192), 19 states have internal predecessors, (192), 6 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (117), 6 states have call predecessors, (117), 6 states have call successors, (117) Word has length 271 [2025-03-08 14:13:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:22,872 INFO L225 Difference]: With dead ends: 1501 [2025-03-08 14:13:22,872 INFO L226 Difference]: Without dead ends: 1005 [2025-03-08 14:13:22,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1107, Invalid=3863, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 14:13:22,875 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 2298 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2303 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 978 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:22,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2303 Valid, 1619 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [978 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 14:13:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-08 14:13:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 908. [2025-03-08 14:13:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 679 states have (on average 1.3122238586156112) internal successors, (891), 681 states have internal predecessors, (891), 200 states have call successors, (200), 28 states have call predecessors, (200), 28 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 14:13:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1291 transitions. [2025-03-08 14:13:22,949 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1291 transitions. Word has length 271 [2025-03-08 14:13:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1291 transitions. [2025-03-08 14:13:22,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.6) internal successors, (192), 19 states have internal predecessors, (192), 6 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (117), 6 states have call predecessors, (117), 6 states have call successors, (117) [2025-03-08 14:13:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1291 transitions. [2025-03-08 14:13:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 14:13:22,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:22,954 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:22,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:13:23,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:23,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:23,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1935050423, now seen corresponding path program 1 times [2025-03-08 14:13:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:23,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617125034] [2025-03-08 14:13:23,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:23,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:23,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:23,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:23,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617125034] [2025-03-08 14:13:23,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617125034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097062056] [2025-03-08 14:13:23,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:23,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:23,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:13:23,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 14:13:23,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 14:13:23,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:23,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:23,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 14:13:23,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1327 proven. 33 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2025-03-08 14:13:23,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 33 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097062056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:23,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-08 14:13:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304875164] [2025-03-08 14:13:23,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 14:13:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 14:13:23,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 14:13:23,935 INFO L87 Difference]: Start difference. First operand 908 states and 1291 transitions. Second operand has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 4 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (82), 4 states have call predecessors, (82), 4 states have call successors, (82) [2025-03-08 14:13:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:24,721 INFO L93 Difference]: Finished difference Result 2347 states and 3230 transitions. [2025-03-08 14:13:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 14:13:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 4 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (82), 4 states have call predecessors, (82), 4 states have call successors, (82) Word has length 271 [2025-03-08 14:13:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:24,728 INFO L225 Difference]: With dead ends: 2347 [2025-03-08 14:13:24,729 INFO L226 Difference]: Without dead ends: 1442 [2025-03-08 14:13:24,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=917, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 14:13:24,733 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 813 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:24,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 657 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:13:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-08 14:13:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1329. [2025-03-08 14:13:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1050 states have (on average 1.2866666666666666) internal successors, (1351), 1057 states have internal predecessors, (1351), 221 states have call successors, (221), 57 states have call predecessors, (221), 57 states have return successors, (221), 214 states have call predecessors, (221), 221 states have call successors, (221) [2025-03-08 14:13:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1793 transitions. [2025-03-08 14:13:24,811 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1793 transitions. Word has length 271 [2025-03-08 14:13:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:24,811 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1793 transitions. [2025-03-08 14:13:24,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 4 states have call successors, (80), 2 states have call predecessors, (80), 4 states have return successors, (82), 4 states have call predecessors, (82), 4 states have call successors, (82) [2025-03-08 14:13:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1793 transitions. [2025-03-08 14:13:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 14:13:24,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:24,814 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:24,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:13:25,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:25,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash -34291805, now seen corresponding path program 1 times [2025-03-08 14:13:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:25,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417556677] [2025-03-08 14:13:25,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:25,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 14:13:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 14:13:25,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 84 proven. 249 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-03-08 14:13:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417556677] [2025-03-08 14:13:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417556677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890079321] [2025-03-08 14:13:25,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:25,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:25,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:25,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:25,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 14:13:25,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 14:13:25,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 14:13:25,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:25,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:25,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 14:13:25,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1190 proven. 48 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-03-08 14:13:25,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 90 proven. 27 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:26,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890079321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:26,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:26,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 19 [2025-03-08 14:13:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468611034] [2025-03-08 14:13:26,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:26,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 14:13:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:26,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 14:13:26,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:13:26,140 INFO L87 Difference]: Start difference. First operand 1329 states and 1793 transitions. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (87), 6 states have call predecessors, (87), 6 states have call successors, (87) [2025-03-08 14:13:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:29,305 INFO L93 Difference]: Finished difference Result 7773 states and 10328 transitions. [2025-03-08 14:13:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-08 14:13:29,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (87), 6 states have call predecessors, (87), 6 states have call successors, (87) Word has length 272 [2025-03-08 14:13:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:29,326 INFO L225 Difference]: With dead ends: 7773 [2025-03-08 14:13:29,326 INFO L226 Difference]: Without dead ends: 6447 [2025-03-08 14:13:29,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 552 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3625 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1922, Invalid=7978, Unknown=0, NotChecked=0, Total=9900 [2025-03-08 14:13:29,332 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 2363 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:29,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 1266 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 14:13:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2025-03-08 14:13:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 1129. [2025-03-08 14:13:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 930 states have (on average 1.3086021505376344) internal successors, (1217), 933 states have internal predecessors, (1217), 147 states have call successors, (147), 51 states have call predecessors, (147), 51 states have return successors, (147), 144 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 14:13:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1511 transitions. [2025-03-08 14:13:29,474 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1511 transitions. Word has length 272 [2025-03-08 14:13:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:29,474 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1511 transitions. [2025-03-08 14:13:29,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 6 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (87), 6 states have call predecessors, (87), 6 states have call successors, (87) [2025-03-08 14:13:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1511 transitions. [2025-03-08 14:13:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 14:13:29,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:29,477 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:29,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 14:13:29,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:29,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:29,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:29,678 INFO L85 PathProgramCache]: Analyzing trace with hash -564412072, now seen corresponding path program 1 times [2025-03-08 14:13:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085497320] [2025-03-08 14:13:29,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:29,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 14:13:29,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 14:13:29,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:29,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:31,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085497320] [2025-03-08 14:13:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085497320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:31,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 14:13:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529896822] [2025-03-08 14:13:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:13:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:31,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:13:31,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:13:31,517 INFO L87 Difference]: Start difference. First operand 1129 states and 1511 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:32,947 INFO L93 Difference]: Finished difference Result 4725 states and 6332 transitions. [2025-03-08 14:13:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 14:13:32,947 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), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 273 [2025-03-08 14:13:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:32,958 INFO L225 Difference]: With dead ends: 4725 [2025-03-08 14:13:32,958 INFO L226 Difference]: Without dead ends: 3599 [2025-03-08 14:13:32,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:13:32,961 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 444 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:32,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 863 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 14:13:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-08 14:13:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2310. [2025-03-08 14:13:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 1913 states have (on average 1.319916361735494) internal successors, (2525), 1919 states have internal predecessors, (2525), 294 states have call successors, (294), 102 states have call predecessors, (294), 102 states have return successors, (294), 288 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-08 14:13:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3113 transitions. [2025-03-08 14:13:33,231 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3113 transitions. Word has length 273 [2025-03-08 14:13:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:33,231 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3113 transitions. [2025-03-08 14:13:33,231 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), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3113 transitions. [2025-03-08 14:13:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-08 14:13:33,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:33,234 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:33,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:13:33,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:33,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1659258441, now seen corresponding path program 1 times [2025-03-08 14:13:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:33,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550668740] [2025-03-08 14:13:33,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:33,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 14:13:33,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 14:13:33,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:33,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550668740] [2025-03-08 14:13:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550668740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:13:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937204769] [2025-03-08 14:13:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:33,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:13:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:33,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:13:33,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:13:33,494 INFO L87 Difference]: Start difference. First operand 2310 states and 3113 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:33,861 INFO L93 Difference]: Finished difference Result 4527 states and 6103 transitions. [2025-03-08 14:13:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:13:33,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 273 [2025-03-08 14:13:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:33,870 INFO L225 Difference]: With dead ends: 4527 [2025-03-08 14:13:33,870 INFO L226 Difference]: Without dead ends: 2220 [2025-03-08 14:13:33,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:13:33,874 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 269 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:33,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 524 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:13:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-03-08 14:13:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2105. [2025-03-08 14:13:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 1708 states have (on average 1.3026932084309133) internal successors, (2225), 1714 states have internal predecessors, (2225), 294 states have call successors, (294), 102 states have call predecessors, (294), 102 states have return successors, (294), 288 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-08 14:13:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2813 transitions. [2025-03-08 14:13:34,131 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2813 transitions. Word has length 273 [2025-03-08 14:13:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 2813 transitions. [2025-03-08 14:13:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2813 transitions. [2025-03-08 14:13:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-08 14:13:34,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:34,135 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:34,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 14:13:34,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:34,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1819303166, now seen corresponding path program 1 times [2025-03-08 14:13:34,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:34,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935877499] [2025-03-08 14:13:34,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:34,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:34,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 14:13:34,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 14:13:34,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935877499] [2025-03-08 14:13:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935877499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336666886] [2025-03-08 14:13:34,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:34,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:34,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:34,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 14:13:34,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-08 14:13:34,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-08 14:13:34,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:34,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:34,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 14:13:34,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-03-08 14:13:35,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336666886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:35,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:35,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-08 14:13:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277567097] [2025-03-08 14:13:35,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:35,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 14:13:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:35,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 14:13:35,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-08 14:13:35,406 INFO L87 Difference]: Start difference. First operand 2105 states and 2813 transitions. Second operand has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 5 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) [2025-03-08 14:13:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:36,294 INFO L93 Difference]: Finished difference Result 4279 states and 5700 transitions. [2025-03-08 14:13:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 14:13:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 5 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) Word has length 274 [2025-03-08 14:13:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:36,302 INFO L225 Difference]: With dead ends: 4279 [2025-03-08 14:13:36,302 INFO L226 Difference]: Without dead ends: 2177 [2025-03-08 14:13:36,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:13:36,305 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 540 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:36,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1280 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:13:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2025-03-08 14:13:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2107. [2025-03-08 14:13:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1710 states have (on average 1.3011695906432748) internal successors, (2225), 1716 states have internal predecessors, (2225), 294 states have call successors, (294), 102 states have call predecessors, (294), 102 states have return successors, (294), 288 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-08 14:13:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2813 transitions. [2025-03-08 14:13:36,530 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2813 transitions. Word has length 274 [2025-03-08 14:13:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2813 transitions. [2025-03-08 14:13:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 5 states have call successors, (116), 3 states have call predecessors, (116), 6 states have return successors, (117), 5 states have call predecessors, (117), 5 states have call successors, (117) [2025-03-08 14:13:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2813 transitions. [2025-03-08 14:13:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 14:13:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:36,533 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:36,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 14:13:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:36,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 66417457, now seen corresponding path program 1 times [2025-03-08 14:13:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119350958] [2025-03-08 14:13:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:36,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 14:13:36,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 14:13:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:36,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 39 proven. 78 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:13:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119350958] [2025-03-08 14:13:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119350958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:13:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325879105] [2025-03-08 14:13:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:37,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:37,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:13:37,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:13:37,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 14:13:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 14:13:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 14:13:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:37,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:13:37,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:13:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1985 proven. 87 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2025-03-08 14:13:37,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:13:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-08 14:13:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325879105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:13:37,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:13:37,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-08 14:13:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861922697] [2025-03-08 14:13:37,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:13:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 14:13:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:37,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 14:13:37,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-08 14:13:37,956 INFO L87 Difference]: Start difference. First operand 2107 states and 2813 transitions. Second operand has 24 states, 23 states have (on average 7.956521739130435) internal successors, (183), 22 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-08 14:13:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:40,733 INFO L93 Difference]: Finished difference Result 6227 states and 8177 transitions. [2025-03-08 14:13:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 14:13:40,734 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.956521739130435) internal successors, (183), 22 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 275 [2025-03-08 14:13:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:40,747 INFO L225 Difference]: With dead ends: 6227 [2025-03-08 14:13:40,747 INFO L226 Difference]: Without dead ends: 4123 [2025-03-08 14:13:40,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2075, Invalid=7045, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 14:13:40,753 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3158 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3158 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:40,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3158 Valid, 1081 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 14:13:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4123 states. [2025-03-08 14:13:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4123 to 981. [2025-03-08 14:13:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 773 states have (on average 1.260025873221216) internal successors, (974), 776 states have internal predecessors, (974), 147 states have call successors, (147), 60 states have call predecessors, (147), 60 states have return successors, (147), 144 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 14:13:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1268 transitions. [2025-03-08 14:13:40,997 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1268 transitions. Word has length 275 [2025-03-08 14:13:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:40,997 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1268 transitions. [2025-03-08 14:13:40,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.956521739130435) internal successors, (183), 22 states have internal predecessors, (183), 9 states have call successors, (101), 4 states have call predecessors, (101), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-03-08 14:13:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1268 transitions. [2025-03-08 14:13:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 14:13:41,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:41,000 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:41,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 14:13:41,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:13:41,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:41,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash -521615089, now seen corresponding path program 1 times [2025-03-08 14:13:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458706306] [2025-03-08 14:13:41,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:41,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 14:13:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 14:13:41,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:13:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-08 14:13:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:13:41,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458706306] [2025-03-08 14:13:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458706306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:13:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:13:41,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:13:41,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910457179] [2025-03-08 14:13:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:13:41,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:13:41,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:13:41,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:13:41,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:13:41,384 INFO L87 Difference]: Start difference. First operand 981 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:13:41,814 INFO L93 Difference]: Finished difference Result 2061 states and 2686 transitions. [2025-03-08 14:13:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:13:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 276 [2025-03-08 14:13:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:13:41,822 INFO L225 Difference]: With dead ends: 2061 [2025-03-08 14:13:41,823 INFO L226 Difference]: Without dead ends: 1083 [2025-03-08 14:13:41,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:13:41,825 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 229 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:13:41,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 491 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:13:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-08 14:13:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 989. [2025-03-08 14:13:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 781 states have (on average 1.2573623559539053) internal successors, (982), 784 states have internal predecessors, (982), 147 states have call successors, (147), 60 states have call predecessors, (147), 60 states have return successors, (147), 144 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-08 14:13:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1276 transitions. [2025-03-08 14:13:42,048 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1276 transitions. Word has length 276 [2025-03-08 14:13:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:13:42,048 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1276 transitions. [2025-03-08 14:13:42,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-08 14:13:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1276 transitions. [2025-03-08 14:13:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 14:13:42,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:13:42,050 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:13:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 14:13:42,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:13:42,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:13:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 723149392, now seen corresponding path program 1 times [2025-03-08 14:13:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:13:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422725667] [2025-03-08 14:13:42,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:13:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:13:42,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 14:13:42,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 14:13:42,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:13:42,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:14:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2025-03-08 14:14:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:14:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422725667] [2025-03-08 14:14:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422725667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:14:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137455654] [2025-03-08 14:14:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:14:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:14:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:14:09,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:14:09,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 14:14:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 14:14:09,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 14:14:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:14:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:14:09,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:14:09,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:14:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2021 proven. 126 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-08 14:14:18,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:14:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 207 proven. 135 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-08 14:14:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137455654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:14:20,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:14:20,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 37 [2025-03-08 14:14:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916394438] [2025-03-08 14:14:20,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:14:20,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 14:14:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:14:20,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 14:14:20,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1134, Unknown=2, NotChecked=0, Total=1332 [2025-03-08 14:14:20,011 INFO L87 Difference]: Start difference. First operand 989 states and 1276 transitions. Second operand has 37 states, 36 states have (on average 5.194444444444445) internal successors, (187), 35 states have internal predecessors, (187), 9 states have call successors, (108), 4 states have call predecessors, (108), 9 states have return successors, (109), 9 states have call predecessors, (109), 9 states have call successors, (109)