./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-72.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_operatoramount_amount250_file-72.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 334dc4437eaac80eceb8d1af75e80c429404d34e2c4d4fc214f68fc3c74220fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:14:50,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:14:50,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:14:50,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:14:50,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:14:50,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:14:50,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:14:50,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:14:50,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:14:50,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:14:50,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:14:50,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:14:50,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:14:50,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:14:50,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:14:50,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:14:50,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:14:50,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:14:50,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:14:50,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 334dc4437eaac80eceb8d1af75e80c429404d34e2c4d4fc214f68fc3c74220fb [2025-03-04 00:14:50,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:14:50,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:14:50,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:14:50,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:14:50,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:14:50,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-72.i [2025-03-04 00:14:51,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5111f4cb/586f899a8b854f9a806fc66d7952e2eb/FLAG648b67c5c [2025-03-04 00:14:51,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:14:51,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-72.i [2025-03-04 00:14:51,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5111f4cb/586f899a8b854f9a806fc66d7952e2eb/FLAG648b67c5c [2025-03-04 00:14:52,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5111f4cb/586f899a8b854f9a806fc66d7952e2eb [2025-03-04 00:14:52,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:14:52,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:14:52,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:14:52,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:14:52,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:14:52,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cb7570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52, skipping insertion in model container [2025-03-04 00:14:52,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:14:52,295 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_operatoramount_amount250_file-72.i[916,929] [2025-03-04 00:14:52,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:52,411 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:14:52,420 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_operatoramount_amount250_file-72.i[916,929] [2025-03-04 00:14:52,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:14:52,495 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:14:52,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52 WrapperNode [2025-03-04 00:14:52,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:14:52,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:52,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:14:52,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:14:52,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,579 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-03-04 00:14:52,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:14:52,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:14:52,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:14:52,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:14:52,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,625 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:14:52,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:14:52,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:14:52,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:14:52,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:14:52,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (1/1) ... [2025-03-04 00:14:52,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:14:52,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:52,688 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-04 00:14:52,694 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-04 00:14:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:14:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:14:52,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:14:52,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:14:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:14:52,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:14:52,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:14:52,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:14:53,399 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc property_#t~ite42#1;havoc property_#t~bitwise41#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~short50#1; [2025-03-04 00:14:53,464 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-04 00:14:53,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:14:53,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:14:53,485 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:14:53,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:14:53 BoogieIcfgContainer [2025-03-04 00:14:53,486 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:14:53,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:14:53,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:14:53,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:14:53,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:14:52" (1/3) ... [2025-03-04 00:14:53,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2ee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:14:53, skipping insertion in model container [2025-03-04 00:14:53,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:14:52" (2/3) ... [2025-03-04 00:14:53,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b2ee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:14:53, skipping insertion in model container [2025-03-04 00:14:53,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:14:53" (3/3) ... [2025-03-04 00:14:53,493 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-72.i [2025-03-04 00:14:53,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:14:53,506 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-72.i that has 2 procedures, 190 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:14:53,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:14:53,563 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;@33a8c049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:14:53,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:14:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 134 states have internal predecessors, (196), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:14:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:53,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:53,586 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:53,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash 177445938, now seen corresponding path program 1 times [2025-03-04 00:14:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953992833] [2025-03-04 00:14:53,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:53,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:53,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:53,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:14:54,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953992833] [2025-03-04 00:14:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953992833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083247374] [2025-03-04 00:14:54,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:54,043 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-04 00:14:54,045 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-04 00:14:54,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:54,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:54,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:54,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:54,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:14:54,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:14:54,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:14:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083247374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:54,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:14:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309571847] [2025-03-04 00:14:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:14:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:54,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:14:54,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:14:54,320 INFO L87 Difference]: Start difference. First operand has 190 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 134 states have internal predecessors, (196), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:14:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:54,373 INFO L93 Difference]: Finished difference Result 373 states and 655 transitions. [2025-03-04 00:14:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:14:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 354 [2025-03-04 00:14:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:54,384 INFO L225 Difference]: With dead ends: 373 [2025-03-04 00:14:54,384 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 00:14:54,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 355 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-04 00:14:54,391 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:54,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:14:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 00:14:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-04 00:14:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 130 states have internal predecessors, (188), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:14:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2025-03-04 00:14:54,443 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 354 [2025-03-04 00:14:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:54,443 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2025-03-04 00:14:54,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:14:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2025-03-04 00:14:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:54,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:54,448 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:54,456 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-04 00:14:54,649 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-04 00:14:54,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:54,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -755739506, now seen corresponding path program 1 times [2025-03-04 00:14:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797431290] [2025-03-04 00:14:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:54,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:54,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:54,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:54,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:14:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797431290] [2025-03-04 00:14:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797431290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:14:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172993987] [2025-03-04 00:14:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:54,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:14:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:54,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:14:54,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:14:54,968 INFO L87 Difference]: Start difference. First operand 186 states and 296 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:55,055 INFO L93 Difference]: Finished difference Result 442 states and 704 transitions. [2025-03-04 00:14:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:14:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 354 [2025-03-04 00:14:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:55,059 INFO L225 Difference]: With dead ends: 442 [2025-03-04 00:14:55,059 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 00:14:55,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:14:55,063 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 102 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 613 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:14:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 00:14:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 213. [2025-03-04 00:14:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 157 states have (on average 1.4968152866242037) internal successors, (235), 157 states have internal predecessors, (235), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:14:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 343 transitions. [2025-03-04 00:14:55,087 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 343 transitions. Word has length 354 [2025-03-04 00:14:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 343 transitions. [2025-03-04 00:14:55,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 343 transitions. [2025-03-04 00:14:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:55,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:55,094 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:55,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:14:55,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:55,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash 705840493, now seen corresponding path program 1 times [2025-03-04 00:14:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150820331] [2025-03-04 00:14:55,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:55,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:55,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:55,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:55,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:14:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150820331] [2025-03-04 00:14:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150820331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:56,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:14:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029625169] [2025-03-04 00:14:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:56,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:14:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:56,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:14:56,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:14:56,315 INFO L87 Difference]: Start difference. First operand 213 states and 343 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:56,808 INFO L93 Difference]: Finished difference Result 630 states and 1017 transitions. [2025-03-04 00:14:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:14:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 354 [2025-03-04 00:14:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:56,813 INFO L225 Difference]: With dead ends: 630 [2025-03-04 00:14:56,813 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 00:14:56,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:14:56,815 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 568 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:56,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 581 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:14:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 00:14:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 272. [2025-03-04 00:14:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 216 states have (on average 1.5416666666666667) internal successors, (333), 216 states have internal predecessors, (333), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:14:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 441 transitions. [2025-03-04 00:14:56,849 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 441 transitions. Word has length 354 [2025-03-04 00:14:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:56,850 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 441 transitions. [2025-03-04 00:14:56,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 441 transitions. [2025-03-04 00:14:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:56,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:56,855 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:14:56,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 829913740, now seen corresponding path program 1 times [2025-03-04 00:14:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12275569] [2025-03-04 00:14:56,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:56,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:57,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:57,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:14:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12275569] [2025-03-04 00:14:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12275569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:57,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:57,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:14:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88391268] [2025-03-04 00:14:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:57,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:14:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:57,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:14:57,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:14:57,631 INFO L87 Difference]: Start difference. First operand 272 states and 441 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:57,997 INFO L93 Difference]: Finished difference Result 698 states and 1123 transitions. [2025-03-04 00:14:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:14:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 354 [2025-03-04 00:14:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:58,000 INFO L225 Difference]: With dead ends: 698 [2025-03-04 00:14:58,000 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 00:14:58,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:14:58,005 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 442 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:58,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 599 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:14:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 00:14:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 283. [2025-03-04 00:14:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 227 states have (on average 1.5374449339207048) internal successors, (349), 227 states have internal predecessors, (349), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:14:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 457 transitions. [2025-03-04 00:14:58,038 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 457 transitions. Word has length 354 [2025-03-04 00:14:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:58,039 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 457 transitions. [2025-03-04 00:14:58,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:14:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 457 transitions. [2025-03-04 00:14:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:14:58,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:58,044 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:14:58,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:14:58,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:58,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash -14558131, now seen corresponding path program 1 times [2025-03-04 00:14:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928071489] [2025-03-04 00:14:58,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:58,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:58,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:58,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:58,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 9 proven. 150 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:14:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928071489] [2025-03-04 00:14:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928071489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184457788] [2025-03-04 00:14:58,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:58,566 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-04 00:14:58,568 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-04 00:14:58,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:14:58,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:14:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:58,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:14:58,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2903 proven. 84 refuted. 0 times theorem prover too weak. 2737 trivial. 0 not checked. [2025-03-04 00:14:59,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 75 proven. 84 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184457788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:00,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 00:15:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181074400] [2025-03-04 00:15:00,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:00,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:15:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:00,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:15:00,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:15:00,074 INFO L87 Difference]: Start difference. First operand 283 states and 457 transitions. Second operand has 12 states, 12 states have (on average 18.75) internal successors, (225), 12 states have internal predecessors, (225), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-03-04 00:15:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:01,143 INFO L93 Difference]: Finished difference Result 855 states and 1365 transitions. [2025-03-04 00:15:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 00:15:01,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.75) internal successors, (225), 12 states have internal predecessors, (225), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) Word has length 354 [2025-03-04 00:15:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:01,149 INFO L225 Difference]: With dead ends: 855 [2025-03-04 00:15:01,149 INFO L226 Difference]: Without dead ends: 575 [2025-03-04 00:15:01,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:15:01,151 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 811 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:01,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 921 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:15:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-04 00:15:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 561. [2025-03-04 00:15:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 446 states have (on average 1.5022421524663676) internal successors, (670), 446 states have internal predecessors, (670), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 00:15:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 886 transitions. [2025-03-04 00:15:01,226 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 886 transitions. Word has length 354 [2025-03-04 00:15:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 886 transitions. [2025-03-04 00:15:01,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.75) internal successors, (225), 12 states have internal predecessors, (225), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-03-04 00:15:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 886 transitions. [2025-03-04 00:15:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:15:01,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:01,232 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:01,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:15:01,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:01,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:01,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash -620855668, now seen corresponding path program 1 times [2025-03-04 00:15:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947626466] [2025-03-04 00:15:01,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:01,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:15:01,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:15:01,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 15 proven. 144 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:01,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947626466] [2025-03-04 00:15:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947626466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641219443] [2025-03-04 00:15:01,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:01,998 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-04 00:15:02,000 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-04 00:15:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:15:02,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:15:02,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:02,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:15:02,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 1355 proven. 138 refuted. 0 times theorem prover too weak. 4231 trivial. 0 not checked. [2025-03-04 00:15:02,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 21 proven. 138 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641219443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:03,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 00:15:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491858321] [2025-03-04 00:15:03,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:03,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:15:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:03,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:15:03,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:15:03,009 INFO L87 Difference]: Start difference. First operand 561 states and 886 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-03-04 00:15:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:03,861 INFO L93 Difference]: Finished difference Result 1620 states and 2448 transitions. [2025-03-04 00:15:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:15:03,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) Word has length 354 [2025-03-04 00:15:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:03,867 INFO L225 Difference]: With dead ends: 1620 [2025-03-04 00:15:03,867 INFO L226 Difference]: Without dead ends: 1034 [2025-03-04 00:15:03,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 706 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:15:03,871 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 816 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:03,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1045 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:15:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-04 00:15:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 740. [2025-03-04 00:15:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 615 states have (on average 1.469918699186992) internal successors, (904), 617 states have internal predecessors, (904), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:15:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1128 transitions. [2025-03-04 00:15:03,935 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1128 transitions. Word has length 354 [2025-03-04 00:15:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:03,936 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1128 transitions. [2025-03-04 00:15:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 3 states have call predecessors, (150), 3 states have call successors, (150) [2025-03-04 00:15:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1128 transitions. [2025-03-04 00:15:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 00:15:03,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:03,940 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:03,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:15:04,141 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-04 00:15:04,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:04,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 974708750, now seen corresponding path program 1 times [2025-03-04 00:15:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654873633] [2025-03-04 00:15:04,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:04,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:15:04,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:15:04,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 81 proven. 78 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654873633] [2025-03-04 00:15:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654873633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591402643] [2025-03-04 00:15:04,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:04,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:04,919 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-04 00:15:04,920 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-04 00:15:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-04 00:15:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 00:15:05,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:05,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:05,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:15:05,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2933 proven. 162 refuted. 0 times theorem prover too weak. 2629 trivial. 0 not checked. [2025-03-04 00:15:05,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 75 proven. 84 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591402643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:06,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 18 [2025-03-04 00:15:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304967438] [2025-03-04 00:15:06,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:06,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:15:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:06,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:15:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:15:06,011 INFO L87 Difference]: Start difference. First operand 740 states and 1128 transitions. Second operand has 18 states, 18 states have (on average 8.0) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) [2025-03-04 00:15:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:07,021 INFO L93 Difference]: Finished difference Result 1514 states and 2289 transitions. [2025-03-04 00:15:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:15:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.0) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) Word has length 354 [2025-03-04 00:15:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:07,030 INFO L225 Difference]: With dead ends: 1514 [2025-03-04 00:15:07,030 INFO L226 Difference]: Without dead ends: 777 [2025-03-04 00:15:07,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 699 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:15:07,034 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 311 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:07,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1733 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:15:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-04 00:15:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 749. [2025-03-04 00:15:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 620 states have (on average 1.4532258064516128) internal successors, (901), 622 states have internal predecessors, (901), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:15:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1125 transitions. [2025-03-04 00:15:07,090 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1125 transitions. Word has length 354 [2025-03-04 00:15:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1125 transitions. [2025-03-04 00:15:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.0) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (112), 5 states have call predecessors, (112), 5 states have call successors, (112) [2025-03-04 00:15:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1125 transitions. [2025-03-04 00:15:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:15:07,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:07,095 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:07,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:07,296 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-04 00:15:07,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:07,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash -886468986, now seen corresponding path program 1 times [2025-03-04 00:15:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180285815] [2025-03-04 00:15:07,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:07,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:07,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:07,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:07,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:15:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628163382] [2025-03-04 00:15:07,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:07,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:07,553 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-04 00:15:07,555 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-04 00:15:07,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:07,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:07,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:07,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:15:07,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2965 proven. 234 refuted. 0 times theorem prover too weak. 2525 trivial. 0 not checked. [2025-03-04 00:15:08,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 81 proven. 78 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180285815] [2025-03-04 00:15:09,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:15:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628163382] [2025-03-04 00:15:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628163382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:09,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:15:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-04 00:15:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795709706] [2025-03-04 00:15:09,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:15:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:09,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:15:09,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:15:09,510 INFO L87 Difference]: Start difference. First operand 749 states and 1125 transitions. Second operand has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 5 states have call successors, (82), 4 states have call predecessors, (82), 6 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) [2025-03-04 00:15:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:11,669 INFO L93 Difference]: Finished difference Result 1826 states and 2695 transitions. [2025-03-04 00:15:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 00:15:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 5 states have call successors, (82), 4 states have call predecessors, (82), 6 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) Word has length 355 [2025-03-04 00:15:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:11,678 INFO L225 Difference]: With dead ends: 1826 [2025-03-04 00:15:11,678 INFO L226 Difference]: Without dead ends: 1448 [2025-03-04 00:15:11,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=481, Invalid=1325, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 00:15:11,680 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1482 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:11,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1832 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:15:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-03-04 00:15:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 815. [2025-03-04 00:15:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 684 states have (on average 1.4678362573099415) internal successors, (1004), 686 states have internal predecessors, (1004), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 110 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-04 00:15:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1228 transitions. [2025-03-04 00:15:11,732 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1228 transitions. Word has length 355 [2025-03-04 00:15:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1228 transitions. [2025-03-04 00:15:11,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 5 states have call successors, (82), 4 states have call predecessors, (82), 6 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) [2025-03-04 00:15:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1228 transitions. [2025-03-04 00:15:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:15:11,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:11,735 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:11,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:11,940 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-04 00:15:11,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 139023013, now seen corresponding path program 1 times [2025-03-04 00:15:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279787772] [2025-03-04 00:15:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:12,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:15:12,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279787772] [2025-03-04 00:15:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279787772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:15:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186162292] [2025-03-04 00:15:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:12,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:15:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:12,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:15:12,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:12,240 INFO L87 Difference]: Start difference. First operand 815 states and 1228 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:12,643 INFO L93 Difference]: Finished difference Result 2839 states and 4261 transitions. [2025-03-04 00:15:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 355 [2025-03-04 00:15:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:12,652 INFO L225 Difference]: With dead ends: 2839 [2025-03-04 00:15:12,652 INFO L226 Difference]: Without dead ends: 2027 [2025-03-04 00:15:12,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:12,657 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 272 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:12,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1169 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-03-04 00:15:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1893. [2025-03-04 00:15:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1602 states have (on average 1.463171036204744) internal successors, (2344), 1608 states have internal predecessors, (2344), 244 states have call successors, (244), 46 states have call predecessors, (244), 46 states have return successors, (244), 238 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-04 00:15:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2832 transitions. [2025-03-04 00:15:12,769 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2832 transitions. Word has length 355 [2025-03-04 00:15:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:12,769 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2832 transitions. [2025-03-04 00:15:12,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2832 transitions. [2025-03-04 00:15:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:15:12,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:12,774 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:15:12,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1063831269, now seen corresponding path program 1 times [2025-03-04 00:15:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495772850] [2025-03-04 00:15:12,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:12,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:12,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:12,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 93 proven. 66 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495772850] [2025-03-04 00:15:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495772850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328284331] [2025-03-04 00:15:13,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:13,069 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-04 00:15:13,071 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-04 00:15:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:13,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:15:13,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2843 proven. 66 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2025-03-04 00:15:13,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 93 proven. 66 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:13,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328284331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:13,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:15:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613471770] [2025-03-04 00:15:13,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:13,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:15:13,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:13,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:15:13,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:13,623 INFO L87 Difference]: Start difference. First operand 1893 states and 2832 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:15:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:14,091 INFO L93 Difference]: Finished difference Result 3961 states and 5853 transitions. [2025-03-04 00:15:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:15:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 355 [2025-03-04 00:15:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:14,102 INFO L225 Difference]: With dead ends: 3961 [2025-03-04 00:15:14,102 INFO L226 Difference]: Without dead ends: 2071 [2025-03-04 00:15:14,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 707 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:15:14,107 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 173 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:14,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 686 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-03-04 00:15:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1990. [2025-03-04 00:15:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1655 states have (on average 1.4314199395770393) internal successors, (2369), 1662 states have internal predecessors, (2369), 275 states have call successors, (275), 59 states have call predecessors, (275), 59 states have return successors, (275), 268 states have call predecessors, (275), 275 states have call successors, (275) [2025-03-04 00:15:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2919 transitions. [2025-03-04 00:15:14,231 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2919 transitions. Word has length 355 [2025-03-04 00:15:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:14,231 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2919 transitions. [2025-03-04 00:15:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:15:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2919 transitions. [2025-03-04 00:15:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:15:14,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:14,234 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:14,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:14,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:14,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:14,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1301555609, now seen corresponding path program 1 times [2025-03-04 00:15:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031097068] [2025-03-04 00:15:14,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:14,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:14,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:14,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:14,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:15:14,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559222741] [2025-03-04 00:15:14,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:14,645 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-04 00:15:14,646 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-04 00:15:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:14,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:14,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:14,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:14,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:15:14,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2933 proven. 162 refuted. 0 times theorem prover too weak. 2629 trivial. 0 not checked. [2025-03-04 00:15:16,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:15:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031097068] [2025-03-04 00:15:16,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:15:16,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559222741] [2025-03-04 00:15:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559222741] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:15:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2025-03-04 00:15:16,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482932003] [2025-03-04 00:15:16,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:16,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:15:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:16,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:15:16,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:15:16,392 INFO L87 Difference]: Start difference. First operand 1990 states and 2919 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:16,754 INFO L93 Difference]: Finished difference Result 5036 states and 7513 transitions. [2025-03-04 00:15:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:15:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 355 [2025-03-04 00:15:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:16,767 INFO L225 Difference]: With dead ends: 5036 [2025-03-04 00:15:16,767 INFO L226 Difference]: Without dead ends: 3138 [2025-03-04 00:15:16,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:15:16,772 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 604 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:16,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1291 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:15:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2025-03-04 00:15:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2006. [2025-03-04 00:15:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1671 states have (on average 1.4272890484739678) internal successors, (2385), 1678 states have internal predecessors, (2385), 275 states have call successors, (275), 59 states have call predecessors, (275), 59 states have return successors, (275), 268 states have call predecessors, (275), 275 states have call successors, (275) [2025-03-04 00:15:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2935 transitions. [2025-03-04 00:15:16,913 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2935 transitions. Word has length 355 [2025-03-04 00:15:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:16,914 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2935 transitions. [2025-03-04 00:15:16,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2935 transitions. [2025-03-04 00:15:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-04 00:15:16,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:16,917 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:16,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:17,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:17,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:17,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -357748295, now seen corresponding path program 1 times [2025-03-04 00:15:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180537254] [2025-03-04 00:15:17,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:17,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-04 00:15:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-04 00:15:17,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:17,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:15:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180537254] [2025-03-04 00:15:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180537254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:15:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:15:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:15:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803840767] [2025-03-04 00:15:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:15:17,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:15:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:17,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:15:17,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:15:17,436 INFO L87 Difference]: Start difference. First operand 2006 states and 2935 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:17,945 INFO L93 Difference]: Finished difference Result 4540 states and 6651 transitions. [2025-03-04 00:15:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:15:17,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 355 [2025-03-04 00:15:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:17,955 INFO L225 Difference]: With dead ends: 4540 [2025-03-04 00:15:17,955 INFO L226 Difference]: Without dead ends: 2618 [2025-03-04 00:15:17,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:15:17,960 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 360 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:17,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1079 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:15:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2025-03-04 00:15:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2396. [2025-03-04 00:15:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 1982 states have (on average 1.4142280524722504) internal successors, (2803), 1990 states have internal predecessors, (2803), 339 states have call successors, (339), 74 states have call predecessors, (339), 74 states have return successors, (339), 331 states have call predecessors, (339), 339 states have call successors, (339) [2025-03-04 00:15:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3481 transitions. [2025-03-04 00:15:18,117 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3481 transitions. Word has length 355 [2025-03-04 00:15:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3481 transitions. [2025-03-04 00:15:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:15:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3481 transitions. [2025-03-04 00:15:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:15:18,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:18,121 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:15:18,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 106172199, now seen corresponding path program 1 times [2025-03-04 00:15:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:18,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275044920] [2025-03-04 00:15:18,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:18,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:18,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:18,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 9 proven. 150 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:18,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275044920] [2025-03-04 00:15:18,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275044920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:18,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792419861] [2025-03-04 00:15:18,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:18,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:18,932 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-04 00:15:18,934 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-04 00:15:19,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:19,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:19,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:15:19,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 659 proven. 150 refuted. 0 times theorem prover too weak. 4915 trivial. 0 not checked. [2025-03-04 00:15:19,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 9 proven. 150 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792419861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:15:20,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:15:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2025-03-04 00:15:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158985560] [2025-03-04 00:15:20,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:15:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:20,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:15:20,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:15:20,015 INFO L87 Difference]: Start difference. First operand 2396 states and 3481 transitions. Second operand has 17 states, 17 states have (on average 8.0) internal successors, (136), 17 states have internal predecessors, (136), 2 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-04 00:15:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:21,783 INFO L93 Difference]: Finished difference Result 7779 states and 11253 transitions. [2025-03-04 00:15:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 00:15:21,783 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 17 states have internal predecessors, (136), 2 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) Word has length 356 [2025-03-04 00:15:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:21,801 INFO L225 Difference]: With dead ends: 7779 [2025-03-04 00:15:21,801 INFO L226 Difference]: Without dead ends: 5393 [2025-03-04 00:15:21,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 705 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:15:21,807 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1513 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:21,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2291 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:15:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2025-03-04 00:15:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 2360. [2025-03-04 00:15:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1875 states have (on average 1.3722666666666667) internal successors, (2573), 1881 states have internal predecessors, (2573), 395 states have call successors, (395), 89 states have call predecessors, (395), 89 states have return successors, (395), 389 states have call predecessors, (395), 395 states have call successors, (395) [2025-03-04 00:15:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3363 transitions. [2025-03-04 00:15:22,049 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3363 transitions. Word has length 356 [2025-03-04 00:15:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:22,049 INFO L471 AbstractCegarLoop]: Abstraction has 2360 states and 3363 transitions. [2025-03-04 00:15:22,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 17 states have internal predecessors, (136), 2 states have call successors, (104), 2 states have call predecessors, (104), 4 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-04 00:15:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3363 transitions. [2025-03-04 00:15:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:15:22,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:22,052 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:22,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 00:15:22,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 00:15:22,253 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:22,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -755400434, now seen corresponding path program 1 times [2025-03-04 00:15:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:22,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785191766] [2025-03-04 00:15:22,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:22,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:22,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:22,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:22,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:22,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:15:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198581173] [2025-03-04 00:15:22,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:22,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:22,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:22,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:15:22,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 00:15:22,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:22,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:22,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:22,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:22,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:15:22,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 3653 proven. 147 refuted. 0 times theorem prover too weak. 1924 trivial. 0 not checked. [2025-03-04 00:15:23,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785191766] [2025-03-04 00:15:23,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:15:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198581173] [2025-03-04 00:15:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198581173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:23,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:15:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 00:15:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892213933] [2025-03-04 00:15:23,394 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:23,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:15:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:23,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:15:23,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:15:23,396 INFO L87 Difference]: Start difference. First operand 2360 states and 3363 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 3 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-04 00:15:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:24,580 INFO L93 Difference]: Finished difference Result 6345 states and 8757 transitions. [2025-03-04 00:15:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:15:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 3 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 356 [2025-03-04 00:15:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:24,594 INFO L225 Difference]: With dead ends: 6345 [2025-03-04 00:15:24,594 INFO L226 Difference]: Without dead ends: 4077 [2025-03-04 00:15:24,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:15:24,598 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 317 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:24,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 785 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:15:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2025-03-04 00:15:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 3799. [2025-03-04 00:15:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3799 states, 2935 states have (on average 1.317206132879046) internal successors, (3866), 2951 states have internal predecessors, (3866), 669 states have call successors, (669), 194 states have call predecessors, (669), 194 states have return successors, (669), 653 states have call predecessors, (669), 669 states have call successors, (669) [2025-03-04 00:15:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3799 states to 3799 states and 5204 transitions. [2025-03-04 00:15:24,972 INFO L78 Accepts]: Start accepts. Automaton has 3799 states and 5204 transitions. Word has length 356 [2025-03-04 00:15:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:24,973 INFO L471 AbstractCegarLoop]: Abstraction has 3799 states and 5204 transitions. [2025-03-04 00:15:24,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 3 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2025-03-04 00:15:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3799 states and 5204 transitions. [2025-03-04 00:15:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:15:24,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:24,982 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:24,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 00:15:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 00:15:25,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:25,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1164224659, now seen corresponding path program 1 times [2025-03-04 00:15:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483102589] [2025-03-04 00:15:25,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:25,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:25,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:15:25,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122358101] [2025-03-04 00:15:25,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:25,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:25,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:15:25,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 00:15:25,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:25,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:15:25,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 3535 proven. 264 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2025-03-04 00:15:26,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:15:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483102589] [2025-03-04 00:15:31,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:15:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122358101] [2025-03-04 00:15:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122358101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:31,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:15:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 00:15:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094428899] [2025-03-04 00:15:31,259 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:15:31,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:15:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:15:31,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:15:31,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=118, Unknown=1, NotChecked=0, Total=182 [2025-03-04 00:15:31,261 INFO L87 Difference]: Start difference. First operand 3799 states and 5204 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-04 00:15:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:15:33,473 INFO L93 Difference]: Finished difference Result 8004 states and 11036 transitions. [2025-03-04 00:15:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:15:33,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 356 [2025-03-04 00:15:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:15:33,489 INFO L225 Difference]: With dead ends: 8004 [2025-03-04 00:15:33,490 INFO L226 Difference]: Without dead ends: 4305 [2025-03-04 00:15:33,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=101, Invalid=170, Unknown=1, NotChecked=0, Total=272 [2025-03-04 00:15:33,498 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 153 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:15:33,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1390 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:15:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2025-03-04 00:15:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 4207. [2025-03-04 00:15:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 3328 states have (on average 1.3401442307692308) internal successors, (4460), 3341 states have internal predecessors, (4460), 685 states have call successors, (685), 193 states have call predecessors, (685), 193 states have return successors, (685), 672 states have call predecessors, (685), 685 states have call successors, (685) [2025-03-04 00:15:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 5830 transitions. [2025-03-04 00:15:33,839 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 5830 transitions. Word has length 356 [2025-03-04 00:15:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:15:33,839 INFO L471 AbstractCegarLoop]: Abstraction has 4207 states and 5830 transitions. [2025-03-04 00:15:33,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-04 00:15:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 5830 transitions. [2025-03-04 00:15:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-04 00:15:33,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:15:33,842 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:15:33,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 00:15:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:15:34,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:15:34,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:15:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1063038131, now seen corresponding path program 1 times [2025-03-04 00:15:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:15:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878550166] [2025-03-04 00:15:34,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:15:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 81 proven. 78 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:15:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:15:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878550166] [2025-03-04 00:15:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878550166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:15:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609906244] [2025-03-04 00:15:34,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:15:34,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:15:34,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:15:34,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:15:34,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 00:15:35,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-04 00:15:35,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-04 00:15:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:15:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:15:35,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 00:15:35,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:15:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 3116 proven. 576 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2025-03-04 00:15:52,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:16:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 147 proven. 321 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2025-03-04 00:16:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609906244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:16:03,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:16:03,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 22] total 48 [2025-03-04 00:16:03,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208926180] [2025-03-04 00:16:03,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:16:03,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 00:16:03,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:03,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 00:16:03,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1836, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 00:16:03,575 INFO L87 Difference]: Start difference. First operand 4207 states and 5830 transitions. Second operand has 48 states, 48 states have (on average 5.6875) internal successors, (273), 48 states have internal predecessors, (273), 11 states have call successors, (162), 6 states have call predecessors, (162), 14 states have return successors, (162), 11 states have call predecessors, (162), 11 states have call successors, (162)