./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 23:01:27,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:01:27,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:01:27,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:01:27,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:01:27,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:01:27,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:01:27,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:01:27,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:01:27,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:01:27,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:01:27,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:01:27,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:01:27,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:01:27,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:01:27,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:01:27,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:27,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:01:27,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:01:27,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:01:27,718 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-03 23:01:27,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:01:27,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:01:27,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:01:27,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:01:27,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:01:27,943 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-03 23:01:29,051 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413849df1/5e41e6cc18ad4a0a887cd01dd4a21183/FLAG267f28a60 [2025-03-03 23:01:29,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:01:29,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-03 23:01:29,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413849df1/5e41e6cc18ad4a0a887cd01dd4a21183/FLAG267f28a60 [2025-03-03 23:01:29,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/413849df1/5e41e6cc18ad4a0a887cd01dd4a21183 [2025-03-03 23:01:29,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:01:29,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:01:29,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:29,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:01:29,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:01:29,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13be2e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29, skipping insertion in model container [2025-03-03 23:01:29,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:01:29,416 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-03 23:01:29,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:29,521 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:01:29,529 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-03 23:01:29,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:29,588 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:01:29,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29 WrapperNode [2025-03-03 23:01:29,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:29,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:29,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:01:29,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:01:29,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,646 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2025-03-03 23:01:29,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:29,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:01:29,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:01:29,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:01:29,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,688 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:01:29,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:01:29,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:01:29,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:01:29,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:01:29,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (1/1) ... [2025-03-03 23:01:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:29,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:29,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:01:29,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:01:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:01:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:01:29,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:01:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:01:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:01:29,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:01:29,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:01:29,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:01:30,292 INFO L1325 $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-03 23:01:30,337 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-03 23:01:30,337 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:01:30,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:01:30,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:01:30,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:30 BoogieIcfgContainer [2025-03-03 23:01:30,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:01:30,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:01:30,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:01:30,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:01:30,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:29" (1/3) ... [2025-03-03 23:01:30,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ffa0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:30, skipping insertion in model container [2025-03-03 23:01:30,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:29" (2/3) ... [2025-03-03 23:01:30,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ffa0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:30, skipping insertion in model container [2025-03-03 23:01:30,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:30" (3/3) ... [2025-03-03 23:01:30,373 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-68.i [2025-03-03 23:01:30,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:01:30,385 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-03 23:01:30,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:01:30,430 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;@4a476f03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:01:30,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:01:30,435 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-03 23:01:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 23:01:30,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:30,461 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-03 23:01:30,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:30,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:30,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2112434822, now seen corresponding path program 1 times [2025-03-03 23:01:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361990672] [2025-03-03 23:01:30,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:30,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 23:01:30,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 23:01:30,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:30,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:30,797 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-03 23:01:30,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361990672] [2025-03-03 23:01:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361990672] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151249858] [2025-03-03 23:01:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:30,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:30,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:30,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:01:30,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 23:01:30,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 23:01:30,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:30,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:30,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:01:30,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:31,023 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-03 23:01:31,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:01:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151249858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:01:31,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:01:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330338882] [2025-03-03 23:01:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:31,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:01:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:01:31,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:01:31,054 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-03 23:01:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:31,115 INFO L93 Difference]: Finished difference Result 318 states and 541 transitions. [2025-03-03 23:01:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:01:31,117 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-03 23:01:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:31,122 INFO L225 Difference]: With dead ends: 318 [2025-03-03 23:01:31,122 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 23:01:31,127 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-03 23:01:31,131 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-03 23:01:31,132 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-03 23:01:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 23:01:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-03 23:01:31,176 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-03 23:01:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-03-03 23:01:31,183 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 269 [2025-03-03 23:01:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-03-03 23:01:31,184 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-03 23:01:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-03-03 23:01:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 23:01:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:31,190 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-03 23:01:31,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:01:31,392 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-03 23:01:31,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2079483428, now seen corresponding path program 1 times [2025-03-03 23:01:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875506305] [2025-03-03 23:01:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:31,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 23:01:31,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 23:01:31,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:31,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:33,426 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-03 23:01:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:33,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875506305] [2025-03-03 23:01:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875506305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 23:01:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743087082] [2025-03-03 23:01:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:33,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:01:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:33,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:01:33,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:01:33,432 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-03 23:01:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:34,492 INFO L93 Difference]: Finished difference Result 633 states and 980 transitions. [2025-03-03 23:01:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 23:01:34,492 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-03 23:01:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:34,500 INFO L225 Difference]: With dead ends: 633 [2025-03-03 23:01:34,500 INFO L226 Difference]: Without dead ends: 477 [2025-03-03 23:01:34,501 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-03 23:01:34,502 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 866 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:34,503 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.9s Time] [2025-03-03 23:01:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-03 23:01:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 450. [2025-03-03 23:01:34,561 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-03 23:01:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 700 transitions. [2025-03-03 23:01:34,565 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 700 transitions. Word has length 269 [2025-03-03 23:01:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:34,567 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 700 transitions. [2025-03-03 23:01:34,568 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-03 23:01:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 700 transitions. [2025-03-03 23:01:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-03 23:01:34,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:34,574 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-03 23:01:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:01:34,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash -862174171, now seen corresponding path program 1 times [2025-03-03 23:01:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667356278] [2025-03-03 23:01:34,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:34,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 23:01:34,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 23:01:34,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:34,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:34,965 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-03 23:01:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667356278] [2025-03-03 23:01:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667356278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660627918] [2025-03-03 23:01:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:34,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:34,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:34,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:01:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-03 23:01:35,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-03 23:01:35,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:35,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:35,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:01:35,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:35,888 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-03 23:01:35,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:36,334 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-03 23:01:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660627918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:36,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:36,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-03-03 23:01:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774325797] [2025-03-03 23:01:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:36,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 23:01:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:36,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 23:01:36,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:01:36,337 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-03 23:01:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:36,937 INFO L93 Difference]: Finished difference Result 875 states and 1344 transitions. [2025-03-03 23:01:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:01:36,938 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-03 23:01:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:36,943 INFO L225 Difference]: With dead ends: 875 [2025-03-03 23:01:36,944 INFO L226 Difference]: Without dead ends: 428 [2025-03-03 23:01:36,946 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-03 23:01:36,948 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-03 23:01:36,948 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-03 23:01:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-03 23:01:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 424. [2025-03-03 23:01:36,989 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-03 23:01:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 614 transitions. [2025-03-03 23:01:36,992 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 614 transitions. Word has length 269 [2025-03-03 23:01:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:36,995 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 614 transitions. [2025-03-03 23:01:36,995 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-03 23:01:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 614 transitions. [2025-03-03 23:01:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 23:01:36,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:36,999 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-03 23:01:37,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:01:37,200 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-03 23:01:37,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:37,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -15249832, now seen corresponding path program 1 times [2025-03-03 23:01:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10000166] [2025-03-03 23:01:37,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:37,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:37,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:37,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:37,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:39,253 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-03 23:01:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10000166] [2025-03-03 23:01:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10000166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:39,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:01:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048036698] [2025-03-03 23:01:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:39,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:01:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:39,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:01:39,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:01:39,255 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-03 23:01:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:40,663 INFO L93 Difference]: Finished difference Result 1035 states and 1475 transitions. [2025-03-03 23:01:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:01:40,664 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-03 23:01:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:40,670 INFO L225 Difference]: With dead ends: 1035 [2025-03-03 23:01:40,670 INFO L226 Difference]: Without dead ends: 614 [2025-03-03 23:01:40,671 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-03 23:01:40,673 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.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:40,673 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.1s Time] [2025-03-03 23:01:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-03 23:01:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 459. [2025-03-03 23:01:40,706 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-03 23:01:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 666 transitions. [2025-03-03 23:01:40,709 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 666 transitions. Word has length 271 [2025-03-03 23:01:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:40,709 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 666 transitions. [2025-03-03 23:01:40,710 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-03 23:01:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 666 transitions. [2025-03-03 23:01:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 23:01:40,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:40,712 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-03 23:01:40,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:01:40,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:40,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1492301977, now seen corresponding path program 1 times [2025-03-03 23:01:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090841995] [2025-03-03 23:01:40,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:40,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:40,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:41,836 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-03 23:01:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090841995] [2025-03-03 23:01:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090841995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:01:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143122616] [2025-03-03 23:01:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:01:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:41,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:01:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:01:41,841 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-03 23:01:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:43,096 INFO L93 Difference]: Finished difference Result 1060 states and 1522 transitions. [2025-03-03 23:01:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:01:43,096 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-03 23:01:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:43,099 INFO L225 Difference]: With dead ends: 1060 [2025-03-03 23:01:43,099 INFO L226 Difference]: Without dead ends: 598 [2025-03-03 23:01:43,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:01:43,101 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 1076 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:43,101 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.0s Time] [2025-03-03 23:01:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-03 23:01:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 491. [2025-03-03 23:01:43,133 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-03 23:01:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 710 transitions. [2025-03-03 23:01:43,137 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 710 transitions. Word has length 271 [2025-03-03 23:01:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 710 transitions. [2025-03-03 23:01:43,139 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-03 23:01:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 710 transitions. [2025-03-03 23:01:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 23:01:43,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:43,144 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-03 23:01:43,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:01:43,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1449355622, now seen corresponding path program 1 times [2025-03-03 23:01:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392551178] [2025-03-03 23:01:43,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:43,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:43,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:43,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:43,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:44,131 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-03 23:01:44,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392551178] [2025-03-03 23:01:44,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392551178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:44,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955986420] [2025-03-03 23:01:44,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:44,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:44,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:44,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:01:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:44,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:44,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:44,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:44,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 23:01:44,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:45,146 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-03 23:01:45,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:45,849 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-03 23:01:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955986420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:45,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 20 [2025-03-03 23:01:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465002729] [2025-03-03 23:01:45,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:45,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 23:01:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:45,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 23:01:45,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-03 23:01:45,851 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-03 23:01:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:48,160 INFO L93 Difference]: Finished difference Result 1501 states and 2147 transitions. [2025-03-03 23:01:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-03 23:01:48,161 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-03 23:01:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:48,168 INFO L225 Difference]: With dead ends: 1501 [2025-03-03 23:01:48,168 INFO L226 Difference]: Without dead ends: 1005 [2025-03-03 23:01:48,171 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-03 23:01:48,171 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 2298 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:48,172 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.5s Time] [2025-03-03 23:01:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-03 23:01:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 908. [2025-03-03 23:01:48,231 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-03 23:01:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1291 transitions. [2025-03-03 23:01:48,234 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1291 transitions. Word has length 271 [2025-03-03 23:01:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1291 transitions. [2025-03-03 23:01:48,235 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-03 23:01:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1291 transitions. [2025-03-03 23:01:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 23:01:48,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:48,238 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-03 23:01:48,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:01:48,438 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-03 23:01:48,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1935050423, now seen corresponding path program 1 times [2025-03-03 23:01:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243154335] [2025-03-03 23:01:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:48,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:48,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:48,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:48,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:48,737 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-03 23:01:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243154335] [2025-03-03 23:01:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243154335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707011671] [2025-03-03 23:01:48,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:48,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:48,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:48,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:01:48,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 23:01:48,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 23:01:48,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:48,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:01:48,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:49,011 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-03 23:01:49,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:49,241 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-03 23:01:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707011671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:49,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-03 23:01:49,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599155029] [2025-03-03 23:01:49,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:49,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:01:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:49,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:01:49,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:01:49,243 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-03 23:01:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:49,985 INFO L93 Difference]: Finished difference Result 2347 states and 3230 transitions. [2025-03-03 23:01:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 23:01:49,986 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-03 23:01:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:49,995 INFO L225 Difference]: With dead ends: 2347 [2025-03-03 23:01:49,995 INFO L226 Difference]: Without dead ends: 1442 [2025-03-03 23:01:50,000 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-03 23:01:50,001 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-03 23:01:50,001 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-03 23:01:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-03-03 23:01:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1329. [2025-03-03 23:01:50,097 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-03 23:01:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1793 transitions. [2025-03-03 23:01:50,102 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1793 transitions. Word has length 271 [2025-03-03 23:01:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1793 transitions. [2025-03-03 23:01:50,102 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-03 23:01:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1793 transitions. [2025-03-03 23:01:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 23:01:50,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:50,104 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-03 23:01:50,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 23:01:50,305 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-03 23:01:50,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:50,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:50,306 INFO L85 PathProgramCache]: Analyzing trace with hash -34291805, now seen corresponding path program 1 times [2025-03-03 23:01:50,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:50,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135554309] [2025-03-03 23:01:50,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:50,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:01:50,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:01:50,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:50,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:50,957 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-03 23:01:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135554309] [2025-03-03 23:01:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135554309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971122788] [2025-03-03 23:01:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:50,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:50,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:50,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 23:01:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 23:01:51,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 23:01:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:51,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 23:01:51,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:51,312 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-03 23:01:51,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:01:51,533 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-03 23:01:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971122788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:01:51,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:01:51,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 19 [2025-03-03 23:01:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196747776] [2025-03-03 23:01:51,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:01:51,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 23:01:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:51,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 23:01:51,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:01:51,535 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-03 23:01:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:54,628 INFO L93 Difference]: Finished difference Result 7773 states and 10328 transitions. [2025-03-03 23:01:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-03 23:01:54,629 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-03 23:01:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:54,648 INFO L225 Difference]: With dead ends: 7773 [2025-03-03 23:01:54,648 INFO L226 Difference]: Without dead ends: 6447 [2025-03-03 23:01:54,652 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-03 23:01:54,653 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-03 23:01:54,653 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-03 23:01:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6447 states. [2025-03-03 23:01:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6447 to 1129. [2025-03-03 23:01:54,783 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-03 23:01:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1511 transitions. [2025-03-03 23:01:54,788 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1511 transitions. Word has length 272 [2025-03-03 23:01:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1511 transitions. [2025-03-03 23:01:54,789 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-03 23:01:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1511 transitions. [2025-03-03 23:01:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 23:01:54,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:54,791 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-03 23:01:54,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 23:01:54,991 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-03 23:01:54,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:54,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash -564412072, now seen corresponding path program 1 times [2025-03-03 23:01:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948158119] [2025-03-03 23:01:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 23:01:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 23:01:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:56,879 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-03 23:01:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:56,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948158119] [2025-03-03 23:01:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948158119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:01:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619682533] [2025-03-03 23:01:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:56,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:01:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:56,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:01:56,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:01:56,881 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-03 23:01:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:58,300 INFO L93 Difference]: Finished difference Result 4725 states and 6332 transitions. [2025-03-03 23:01:58,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 23:01:58,300 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-03 23:01:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:58,312 INFO L225 Difference]: With dead ends: 4725 [2025-03-03 23:01:58,312 INFO L226 Difference]: Without dead ends: 3599 [2025-03-03 23:01:58,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:01:58,315 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-03 23:01:58,315 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-03 23:01:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-03 23:01:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 2310. [2025-03-03 23:01:58,581 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-03 23:01:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3113 transitions. [2025-03-03 23:01:58,587 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3113 transitions. Word has length 273 [2025-03-03 23:01:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:58,589 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3113 transitions. [2025-03-03 23:01:58,589 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-03 23:01:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3113 transitions. [2025-03-03 23:01:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 23:01:58,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:58,591 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-03 23:01:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:01:58,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1659258441, now seen corresponding path program 1 times [2025-03-03 23:01:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032807325] [2025-03-03 23:01:58,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:58,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 23:01:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 23:01:58,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:58,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:58,812 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-03 23:01:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032807325] [2025-03-03 23:01:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032807325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:58,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:58,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549534359] [2025-03-03 23:01:58,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:58,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:58,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:58,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:58,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:58,814 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-03 23:01:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:59,197 INFO L93 Difference]: Finished difference Result 4527 states and 6103 transitions. [2025-03-03 23:01:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:59,197 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-03 23:01:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:59,205 INFO L225 Difference]: With dead ends: 4527 [2025-03-03 23:01:59,206 INFO L226 Difference]: Without dead ends: 2220 [2025-03-03 23:01:59,209 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-03 23:01:59,209 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-03 23:01:59,210 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-03 23:01:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-03-03 23:01:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2105. [2025-03-03 23:01:59,519 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-03 23:01:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2813 transitions. [2025-03-03 23:01:59,527 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2813 transitions. Word has length 273 [2025-03-03 23:01:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:59,528 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 2813 transitions. [2025-03-03 23:01:59,528 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-03 23:01:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2813 transitions. [2025-03-03 23:01:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 23:01:59,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:59,530 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-03 23:01:59,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:01:59,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:59,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1819303166, now seen corresponding path program 1 times [2025-03-03 23:01:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194818954] [2025-03-03 23:01:59,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:59,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 23:01:59,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 23:01:59,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:59,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:59,793 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-03 23:01:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194818954] [2025-03-03 23:01:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194818954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704448283] [2025-03-03 23:01:59,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:59,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:59,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:01:59,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 23:01:59,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 23:01:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 23:01:59,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:59,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 23:01:59,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:02:00,508 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-03 23:02:00,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:02:00,765 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-03 23:02:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704448283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:02:00,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:02:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-03 23:02:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141580850] [2025-03-03 23:02:00,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:02:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:02:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:02:00,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:02:00,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:02:00,767 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-03 23:02:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:02:01,679 INFO L93 Difference]: Finished difference Result 4279 states and 5700 transitions. [2025-03-03 23:02:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:02:01,680 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-03 23:02:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:02:01,687 INFO L225 Difference]: With dead ends: 4279 [2025-03-03 23:02:01,687 INFO L226 Difference]: Without dead ends: 2177 [2025-03-03 23:02:01,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:02:01,690 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-03 23:02:01,690 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-03 23:02:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2025-03-03 23:02:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2107. [2025-03-03 23:02:01,906 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-03 23:02:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2813 transitions. [2025-03-03 23:02:01,912 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2813 transitions. Word has length 274 [2025-03-03 23:02:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:02:01,912 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2813 transitions. [2025-03-03 23:02:01,912 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-03 23:02:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2813 transitions. [2025-03-03 23:02:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 23:02:01,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:01,914 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-03 23:02:01,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 23:02:02,115 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-03 23:02:02,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:02,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 66417457, now seen corresponding path program 1 times [2025-03-03 23:02:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:02:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137341376] [2025-03-03 23:02:02,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:02:02,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:02:02,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:02:02,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:02,417 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-03 23:02:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:02:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137341376] [2025-03-03 23:02:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137341376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:02:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255721289] [2025-03-03 23:02:02,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:02,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:02:02,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:02:02,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:02:02,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 23:02:02,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 23:02:02,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 23:02:02,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:02,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:02,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 23:02:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:02:03,017 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-03 23:02:03,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:02:03,399 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-03 23:02:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255721289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:02:03,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:02:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-03 23:02:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747897652] [2025-03-03 23:02:03,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:02:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 23:02:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:02:03,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 23:02:03,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:02:03,401 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-03 23:02:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:02:06,266 INFO L93 Difference]: Finished difference Result 6227 states and 8177 transitions. [2025-03-03 23:02:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-03 23:02:06,267 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-03 23:02:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:02:06,279 INFO L225 Difference]: With dead ends: 6227 [2025-03-03 23:02:06,279 INFO L226 Difference]: Without dead ends: 4123 [2025-03-03 23:02:06,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2075, Invalid=7045, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 23:02:06,285 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3158 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:02:06,285 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.2s Time] [2025-03-03 23:02:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4123 states. [2025-03-03 23:02:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4123 to 981. [2025-03-03 23:02:06,505 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-03 23:02:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1268 transitions. [2025-03-03 23:02:06,508 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1268 transitions. Word has length 275 [2025-03-03 23:02:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:02:06,509 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1268 transitions. [2025-03-03 23:02:06,509 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-03 23:02:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1268 transitions. [2025-03-03 23:02:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 23:02:06,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:06,511 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-03 23:02:06,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 23:02:06,711 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-03 23:02:06,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:06,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash -521615089, now seen corresponding path program 1 times [2025-03-03 23:02:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:02:06,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236997477] [2025-03-03 23:02:06,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:02:06,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 23:02:06,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 23:02:06,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:06,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:06,880 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-03 23:02:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:02:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236997477] [2025-03-03 23:02:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236997477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:02:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:02:06,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:02:06,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491384697] [2025-03-03 23:02:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:02:06,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:02:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:02:06,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:02:06,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:02:06,882 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-03 23:02:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:02:07,266 INFO L93 Difference]: Finished difference Result 2061 states and 2686 transitions. [2025-03-03 23:02:07,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:02:07,266 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-03 23:02:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:02:07,271 INFO L225 Difference]: With dead ends: 2061 [2025-03-03 23:02:07,271 INFO L226 Difference]: Without dead ends: 1083 [2025-03-03 23:02:07,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:02:07,273 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 229 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03 23:02:07,273 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-03 23:02:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-03 23:02:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 989. [2025-03-03 23:02:07,456 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-03 23:02:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1276 transitions. [2025-03-03 23:02:07,458 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1276 transitions. Word has length 276 [2025-03-03 23:02:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:02:07,459 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1276 transitions. [2025-03-03 23:02:07,459 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-03 23:02:07,459 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1276 transitions. [2025-03-03 23:02:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 23:02:07,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:02:07,460 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-03 23:02:07,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:02:07,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:02:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:02:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash 723149392, now seen corresponding path program 1 times [2025-03-03 23:02:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:02:07,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137253508] [2025-03-03 23:02:07,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:02:07,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 23:02:07,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 23:02:07,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:07,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:36,168 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-03 23:02:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:02:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137253508] [2025-03-03 23:02:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137253508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:02:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795076968] [2025-03-03 23:02:36,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:02:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:02:36,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:02:36,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 23:02:36,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 23:02:36,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 23:02:36,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:36,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:36,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 23:02:36,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:02:45,359 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-03 23:02:45,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:02:46,561 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-03 23:02:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795076968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:02:46,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:02:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 37 [2025-03-03 23:02:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133142369] [2025-03-03 23:02:46,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:02:46,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 23:02:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:02:46,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 23:02:46,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1134, Unknown=2, NotChecked=0, Total=1332 [2025-03-03 23:02:46,563 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)