./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.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 f936db2b47677a90e81718d3591b9d45243b1a66e00c73ec4ccd3f4a235b10d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:35:31,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:35:31,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:35:31,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:35:31,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:35:31,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:35:31,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:35:31,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:35:31,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:35:31,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:35:31,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:35:31,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:35:31,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:35:31,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:35:31,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:35:31,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:35:31,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:35:31,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:35:31,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:35:31,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:35:31,201 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 -> f936db2b47677a90e81718d3591b9d45243b1a66e00c73ec4ccd3f4a235b10d9 [2025-03-17 01:35:31,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:35:31,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:35:31,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:35:31,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:35:31,430 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:35:31,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-03-17 01:35:32,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb839c8c/a24c1c31bdf945448abc513ddf9141de/FLAG5a8c10bc8 [2025-03-17 01:35:32,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:35:32,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-03-17 01:35:32,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb839c8c/a24c1c31bdf945448abc513ddf9141de/FLAG5a8c10bc8 [2025-03-17 01:35:33,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb839c8c/a24c1c31bdf945448abc513ddf9141de [2025-03-17 01:35:33,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:35:33,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:35:33,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:35:33,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:35:33,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:35:33,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e44b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33, skipping insertion in model container [2025-03-17 01:35:33,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:35:33,235 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_fillercode_fillercodestructure_filler-pr-cn_file-52.i[919,932] [2025-03-17 01:35:33,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:35:33,317 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:35:33,326 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_fillercode_fillercodestructure_filler-pr-cn_file-52.i[919,932] [2025-03-17 01:35:33,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:35:33,371 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:35:33,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33 WrapperNode [2025-03-17 01:35:33,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:35:33,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:35:33,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:35:33,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:35:33,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,420 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-03-17 01:35:33,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:35:33,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:35:33,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:35:33,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:35:33,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,451 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-17 01:35:33,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:35:33,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:35:33,466 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:35:33,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:35:33,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (1/1) ... [2025-03-17 01:35:33,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:35:33,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:35:33,493 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-17 01:35:33,496 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-17 01:35:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:35:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:35:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:35:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:35:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:35:33,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:35:33,585 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:35:33,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:35:33,903 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 01:35:33,904 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:35:33,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:35:33,922 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:35:33,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:35:33 BoogieIcfgContainer [2025-03-17 01:35:33,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:35:33,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:35:33,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:35:33,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:35:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:35:33" (1/3) ... [2025-03-17 01:35:33,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ca9be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:35:33, skipping insertion in model container [2025-03-17 01:35:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:35:33" (2/3) ... [2025-03-17 01:35:33,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ca9be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:35:33, skipping insertion in model container [2025-03-17 01:35:33,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:35:33" (3/3) ... [2025-03-17 01:35:33,930 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i [2025-03-17 01:35:33,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:35:33,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-52.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:35:33,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:35:33,997 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;@2d7cdfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:35:33,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:35:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:35:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-17 01:35:34,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:34,015 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:34,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 539037335, now seen corresponding path program 1 times [2025-03-17 01:35:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:34,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177218494] [2025-03-17 01:35:34,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:34,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 01:35:34,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 01:35:34,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:34,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 01:35:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177218494] [2025-03-17 01:35:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177218494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:35:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189552440] [2025-03-17 01:35:34,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:34,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:35:34,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:35:34,319 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-17 01:35:34,320 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-17 01:35:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 01:35:34,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 01:35:34,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:34,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:34,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:35:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:35:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 01:35:34,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:35:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189552440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:35:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:35:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496773160] [2025-03-17 01:35:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:34,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:35:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:34,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:35:34,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:35:34,546 INFO L87 Difference]: Start difference. First operand has 98 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:35:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:34,579 INFO L93 Difference]: Finished difference Result 193 states and 346 transitions. [2025-03-17 01:35:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:35:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213 [2025-03-17 01:35:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:34,586 INFO L225 Difference]: With dead ends: 193 [2025-03-17 01:35:34,586 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 01:35:34,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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-17 01:35:34,590 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:34,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:35:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 01:35:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 01:35:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:35:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 153 transitions. [2025-03-17 01:35:34,628 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 153 transitions. Word has length 213 [2025-03-17 01:35:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:34,629 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 153 transitions. [2025-03-17 01:35:34,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:35:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 153 transitions. [2025-03-17 01:35:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-17 01:35:34,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:34,634 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:34,641 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-17 01:35:34,835 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-17 01:35:34,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:34,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1707104043, now seen corresponding path program 1 times [2025-03-17 01:35:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663441072] [2025-03-17 01:35:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:34,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 01:35:34,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 01:35:34,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:34,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663441072] [2025-03-17 01:35:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663441072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:35:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724444444] [2025-03-17 01:35:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:35,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:35:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:35,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:35:35,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:35:35,377 INFO L87 Difference]: Start difference. First operand 96 states and 153 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:35,618 INFO L93 Difference]: Finished difference Result 256 states and 408 transitions. [2025-03-17 01:35:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:35:35,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2025-03-17 01:35:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:35,623 INFO L225 Difference]: With dead ends: 256 [2025-03-17 01:35:35,624 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 01:35:35,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:35:35,625 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 95 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:35,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 567 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:35:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 01:35:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-03-17 01:35:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.457142857142857) internal successors, (153), 106 states have internal predecessors, (153), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:35:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 253 transitions. [2025-03-17 01:35:35,644 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 253 transitions. Word has length 213 [2025-03-17 01:35:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:35,644 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 253 transitions. [2025-03-17 01:35:35,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 253 transitions. [2025-03-17 01:35:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-17 01:35:35,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:35,648 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:35:35,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1743391382, now seen corresponding path program 1 times [2025-03-17 01:35:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806121966] [2025-03-17 01:35:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:35,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 01:35:35,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 01:35:35,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:35,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:35,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806121966] [2025-03-17 01:35:35,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806121966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:35,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:35,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:35:35,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987909231] [2025-03-17 01:35:35,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:35,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:35:35,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:35,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:35:35,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:35:35,928 INFO L87 Difference]: Start difference. First operand 158 states and 253 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:35,983 INFO L93 Difference]: Finished difference Result 436 states and 699 transitions. [2025-03-17 01:35:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:35:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2025-03-17 01:35:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:35,988 INFO L225 Difference]: With dead ends: 436 [2025-03-17 01:35:35,988 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 01:35:35,989 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-17 01:35:35,990 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 97 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 336 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:35:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 01:35:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2025-03-17 01:35:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 187 states have (on average 1.4705882352941178) internal successors, (275), 190 states have internal predecessors, (275), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:35:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 443 transitions. [2025-03-17 01:35:36,028 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 443 transitions. Word has length 213 [2025-03-17 01:35:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:36,029 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 443 transitions. [2025-03-17 01:35:36,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 443 transitions. [2025-03-17 01:35:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 01:35:36,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:36,033 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:36,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:35:36,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1362168640, now seen corresponding path program 1 times [2025-03-17 01:35:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323932758] [2025-03-17 01:35:36,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:36,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:35:36,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:35:36,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:36,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:41,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323932758] [2025-03-17 01:35:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323932758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:35:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512370749] [2025-03-17 01:35:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:41,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:35:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:41,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:35:41,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:35:41,410 INFO L87 Difference]: Start difference. First operand 276 states and 443 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:45,230 INFO L93 Difference]: Finished difference Result 1212 states and 1931 transitions. [2025-03-17 01:35:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 01:35:45,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-17 01:35:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:45,240 INFO L225 Difference]: With dead ends: 1212 [2025-03-17 01:35:45,241 INFO L226 Difference]: Without dead ends: 1210 [2025-03-17 01:35:45,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=424, Invalid=1058, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 01:35:45,243 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 661 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:45,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1004 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:35:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-17 01:35:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 729. [2025-03-17 01:35:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 552 states have (on average 1.5217391304347827) internal successors, (840), 558 states have internal predecessors, (840), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-17 01:35:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1176 transitions. [2025-03-17 01:35:45,312 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1176 transitions. Word has length 214 [2025-03-17 01:35:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1176 transitions. [2025-03-17 01:35:45,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1176 transitions. [2025-03-17 01:35:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 01:35:45,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:45,314 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:35:45,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1425246847, now seen corresponding path program 1 times [2025-03-17 01:35:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527297207] [2025-03-17 01:35:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:45,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:35:45,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:35:45,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527297207] [2025-03-17 01:35:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527297207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:45,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:35:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541237851] [2025-03-17 01:35:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:35:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:45,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:35:45,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:35:45,479 INFO L87 Difference]: Start difference. First operand 729 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:45,705 INFO L93 Difference]: Finished difference Result 1994 states and 3218 transitions. [2025-03-17 01:35:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:35:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-17 01:35:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:45,714 INFO L225 Difference]: With dead ends: 1994 [2025-03-17 01:35:45,714 INFO L226 Difference]: Without dead ends: 1266 [2025-03-17 01:35:45,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-17 01:35:45,716 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 192 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:45,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 696 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:35:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-03-17 01:35:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 825. [2025-03-17 01:35:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 612 states have (on average 1.4983660130718954) internal successors, (917), 619 states have internal predecessors, (917), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 195 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:35:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1321 transitions. [2025-03-17 01:35:45,774 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1321 transitions. Word has length 214 [2025-03-17 01:35:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:45,775 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1321 transitions. [2025-03-17 01:35:45,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1321 transitions. [2025-03-17 01:35:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 01:35:45,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:45,777 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:35:45,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -428229215, now seen corresponding path program 1 times [2025-03-17 01:35:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911482489] [2025-03-17 01:35:45,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:45,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:35:45,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:35:45,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:48,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911482489] [2025-03-17 01:35:48,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911482489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:48,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:48,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:35:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227166043] [2025-03-17 01:35:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:48,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:35:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:35:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:35:48,476 INFO L87 Difference]: Start difference. First operand 825 states and 1321 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:35:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:49,379 INFO L93 Difference]: Finished difference Result 2193 states and 3511 transitions. [2025-03-17 01:35:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:35:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 214 [2025-03-17 01:35:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:49,388 INFO L225 Difference]: With dead ends: 2193 [2025-03-17 01:35:49,388 INFO L226 Difference]: Without dead ends: 1429 [2025-03-17 01:35:49,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:35:49,394 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 576 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:49,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 933 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:35:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-17 01:35:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 927. [2025-03-17 01:35:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 714 states have (on average 1.5084033613445378) internal successors, (1077), 720 states have internal predecessors, (1077), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:35:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1481 transitions. [2025-03-17 01:35:49,470 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1481 transitions. Word has length 214 [2025-03-17 01:35:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:49,470 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1481 transitions. [2025-03-17 01:35:49,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:35:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1481 transitions. [2025-03-17 01:35:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 01:35:49,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:49,474 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:49,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:35:49,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1295161887, now seen corresponding path program 1 times [2025-03-17 01:35:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:49,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128102125] [2025-03-17 01:35:49,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:49,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:35:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:35:49,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:49,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128102125] [2025-03-17 01:35:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128102125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:49,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:35:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593175781] [2025-03-17 01:35:49,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:35:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:49,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:35:49,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:35:49,570 INFO L87 Difference]: Start difference. First operand 927 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:49,743 INFO L93 Difference]: Finished difference Result 1202 states and 1919 transitions. [2025-03-17 01:35:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:35:49,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-03-17 01:35:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:49,749 INFO L225 Difference]: With dead ends: 1202 [2025-03-17 01:35:49,749 INFO L226 Difference]: Without dead ends: 891 [2025-03-17 01:35:49,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:35:49,751 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 145 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:49,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 212 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:35:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-17 01:35:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2025-03-17 01:35:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 678 states have (on average 1.4941002949852507) internal successors, (1013), 684 states have internal predecessors, (1013), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:35:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1417 transitions. [2025-03-17 01:35:49,800 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1417 transitions. Word has length 214 [2025-03-17 01:35:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:49,800 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1417 transitions. [2025-03-17 01:35:49,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:35:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1417 transitions. [2025-03-17 01:35:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 01:35:49,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:49,803 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:35:49,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1709523227, now seen corresponding path program 1 times [2025-03-17 01:35:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3349528] [2025-03-17 01:35:49,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:49,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 01:35:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 01:35:49,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:35:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:35:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:35:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3349528] [2025-03-17 01:35:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3349528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:35:54,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:35:54,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:35:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131727764] [2025-03-17 01:35:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:35:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:35:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:35:54,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:35:54,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:35:54,954 INFO L87 Difference]: Start difference. First operand 891 states and 1417 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:35:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:35:57,070 INFO L93 Difference]: Finished difference Result 1560 states and 2465 transitions. [2025-03-17 01:35:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:35:57,070 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 215 [2025-03-17 01:35:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:35:57,075 INFO L225 Difference]: With dead ends: 1560 [2025-03-17 01:35:57,076 INFO L226 Difference]: Without dead ends: 1237 [2025-03-17 01:35:57,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:35:57,077 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 383 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:35:57,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1287 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:35:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-03-17 01:35:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 899. [2025-03-17 01:35:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 686 states have (on average 1.4883381924198251) internal successors, (1021), 692 states have internal predecessors, (1021), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:35:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1425 transitions. [2025-03-17 01:35:57,129 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1425 transitions. Word has length 215 [2025-03-17 01:35:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:35:57,130 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1425 transitions. [2025-03-17 01:35:57,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:35:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1425 transitions. [2025-03-17 01:35:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 01:35:57,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:35:57,133 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:35:57,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:35:57,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:35:57,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:35:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2142348769, now seen corresponding path program 1 times [2025-03-17 01:35:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:35:57,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118413731] [2025-03-17 01:35:57,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:35:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:35:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 01:35:57,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 01:35:57,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:35:57,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:36:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118413731] [2025-03-17 01:36:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118413731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:36:00,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750149438] [2025-03-17 01:36:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:00,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:36:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:00,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:36:00,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:36:00,090 INFO L87 Difference]: Start difference. First operand 899 states and 1425 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:36:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:02,115 INFO L93 Difference]: Finished difference Result 1993 states and 3151 transitions. [2025-03-17 01:36:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:36:02,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 215 [2025-03-17 01:36:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:02,123 INFO L225 Difference]: With dead ends: 1993 [2025-03-17 01:36:02,123 INFO L226 Difference]: Without dead ends: 1261 [2025-03-17 01:36:02,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:36:02,126 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 574 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:02,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 994 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:36:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-17 01:36:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 987. [2025-03-17 01:36:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 774 states have (on average 1.4948320413436693) internal successors, (1157), 780 states have internal predecessors, (1157), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:36:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1561 transitions. [2025-03-17 01:36:02,177 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1561 transitions. Word has length 215 [2025-03-17 01:36:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:02,178 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1561 transitions. [2025-03-17 01:36:02,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:36:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1561 transitions. [2025-03-17 01:36:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 01:36:02,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:02,180 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:36:02,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:36:02,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:02,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1964055935, now seen corresponding path program 1 times [2025-03-17 01:36:02,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957805533] [2025-03-17 01:36:02,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 01:36:02,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 01:36:02,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:36:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957805533] [2025-03-17 01:36:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957805533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:36:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642047818] [2025-03-17 01:36:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:03,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:36:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:03,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:36:03,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:36:03,790 INFO L87 Difference]: Start difference. First operand 987 states and 1561 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:36:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:04,316 INFO L93 Difference]: Finished difference Result 1779 states and 2814 transitions. [2025-03-17 01:36:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:36:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 215 [2025-03-17 01:36:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:04,321 INFO L225 Difference]: With dead ends: 1779 [2025-03-17 01:36:04,321 INFO L226 Difference]: Without dead ends: 1011 [2025-03-17 01:36:04,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:36:04,323 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 199 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:04,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 968 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:36:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-17 01:36:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 947. [2025-03-17 01:36:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 734 states have (on average 1.491825613079019) internal successors, (1095), 740 states have internal predecessors, (1095), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:36:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1499 transitions. [2025-03-17 01:36:04,368 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1499 transitions. Word has length 215 [2025-03-17 01:36:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:04,369 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1499 transitions. [2025-03-17 01:36:04,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 01:36:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1499 transitions. [2025-03-17 01:36:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-17 01:36:04,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:04,375 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:04,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:36:04,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:04,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:04,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1645028709, now seen corresponding path program 1 times [2025-03-17 01:36:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340121775] [2025-03-17 01:36:04,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:04,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 01:36:04,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 01:36:04,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9187 backedges. 1 proven. 74 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-17 01:36:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340121775] [2025-03-17 01:36:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340121775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:36:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011852835] [2025-03-17 01:36:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:08,758 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-17 01:36:08,759 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-17 01:36:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-17 01:36:08,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-17 01:36:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:08,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:36:08,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:36:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9187 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9167 trivial. 0 not checked. [2025-03-17 01:36:08,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:36:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011852835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:08,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:36:08,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2025-03-17 01:36:08,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466550725] [2025-03-17 01:36:08,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:08,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:36:08,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:08,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:36:08,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:36:08,968 INFO L87 Difference]: Start difference. First operand 947 states and 1499 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:09,093 INFO L93 Difference]: Finished difference Result 1567 states and 2480 transitions. [2025-03-17 01:36:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:36:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 427 [2025-03-17 01:36:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:09,098 INFO L225 Difference]: With dead ends: 1567 [2025-03-17 01:36:09,098 INFO L226 Difference]: Without dead ends: 839 [2025-03-17 01:36:09,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:36:09,100 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 140 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:09,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 484 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:36:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-03-17 01:36:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2025-03-17 01:36:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 626 states have (on average 1.4424920127795526) internal successors, (903), 632 states have internal predecessors, (903), 202 states have call successors, (202), 10 states have call predecessors, (202), 10 states have return successors, (202), 196 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-17 01:36:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1307 transitions. [2025-03-17 01:36:09,147 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1307 transitions. Word has length 427 [2025-03-17 01:36:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1307 transitions. [2025-03-17 01:36:09,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1307 transitions. [2025-03-17 01:36:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-17 01:36:09,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:09,151 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:09,158 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-17 01:36:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 01:36:09,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -614481601, now seen corresponding path program 1 times [2025-03-17 01:36:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565184887] [2025-03-17 01:36:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-17 01:36:09,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-17 01:36:09,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:09,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9188 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-17 01:36:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565184887] [2025-03-17 01:36:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565184887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:36:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134951037] [2025-03-17 01:36:14,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:14,545 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-17 01:36:14,546 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-17 01:36:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-17 01:36:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-17 01:36:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-17 01:36:14,781 INFO L279 TraceCheckSpWp]: Computing forward predicates...