./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.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-pe-ci_file-4.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 1f54301a2d25df90ec2ca6a008bffd2d7169340bdd3fa7247718e0e85378bc7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:47:53,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:47:53,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:47:53,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:47:53,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:47:53,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:47:53,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:47:53,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:47:53,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:47:53,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:47:53,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:47:53,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:47:53,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:47:53,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:47:53,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:47:53,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:47:53,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:47:53,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:47:53,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:47:53,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:47:53,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:47:53,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:47:53,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:47:53,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:47:53,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:47:53,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:47:53,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:47:53,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:47:53,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:47:53,134 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 -> 1f54301a2d25df90ec2ca6a008bffd2d7169340bdd3fa7247718e0e85378bc7e [2025-03-17 00:47:53,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:47:53,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:47:53,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:47:53,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:47:53,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:47:53,364 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-pe-ci_file-4.i [2025-03-17 00:47:54,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119519368/c5b035ba9c8949d2a85ff7c0b928187e/FLAGca2891312 [2025-03-17 00:47:54,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:47:54,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i [2025-03-17 00:47:54,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119519368/c5b035ba9c8949d2a85ff7c0b928187e/FLAGca2891312 [2025-03-17 00:47:55,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119519368/c5b035ba9c8949d2a85ff7c0b928187e [2025-03-17 00:47:55,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:47:55,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:47:55,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:47:55,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:47:55,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:47:55,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55, skipping insertion in model container [2025-03-17 00:47:55,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:47:55,270 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-pe-ci_file-4.i[918,931] [2025-03-17 00:47:55,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:47:55,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:47:55,373 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-pe-ci_file-4.i[918,931] [2025-03-17 00:47:55,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:47:55,435 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:47:55,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55 WrapperNode [2025-03-17 00:47:55,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:47:55,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:47:55,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:47:55,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:47:55,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,502 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2025-03-17 00:47:55,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:47:55,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:47:55,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:47:55,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:47:55,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,539 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 00:47:55,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:47:55,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:47:55,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:47:55,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:47:55,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (1/1) ... [2025-03-17 00:47:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:47:55,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:47:55,594 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 00:47:55,597 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 00:47:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:47:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:47:55,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:47:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:47:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:47:55,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:47:55,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:47:55,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:47:56,091 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 00:47:56,091 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:47:56,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:47:56,109 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:47:56,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:47:56 BoogieIcfgContainer [2025-03-17 00:47:56,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:47:56,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:47:56,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:47:56,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:47:56,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:47:55" (1/3) ... [2025-03-17 00:47:56,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cce2123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:47:56, skipping insertion in model container [2025-03-17 00:47:56,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:47:55" (2/3) ... [2025-03-17 00:47:56,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cce2123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:47:56, skipping insertion in model container [2025-03-17 00:47:56,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:47:56" (3/3) ... [2025-03-17 00:47:56,118 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i [2025-03-17 00:47:56,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:47:56,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-4.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:47:56,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:47:56,188 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;@26563bde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:47:56,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:47:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 00:47:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 00:47:56,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:56,200 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:47:56,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1713723558, now seen corresponding path program 1 times [2025-03-17 00:47:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719842266] [2025-03-17 00:47:56,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 00:47:56,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 00:47:56,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:56,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-17 00:47:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719842266] [2025-03-17 00:47:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719842266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:47:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621492876] [2025-03-17 00:47:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:47:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:47:56,532 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 00:47:56,539 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 00:47:56,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 00:47:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 00:47:56,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:56,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:47:56,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:47:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-17 00:47:56,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:47:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621492876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:56,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:47:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:47:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629289451] [2025-03-17 00:47:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:47:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:56,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:47:56,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:47:56,810 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 00:47:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:56,832 INFO L93 Difference]: Finished difference Result 183 states and 335 transitions. [2025-03-17 00:47:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:47:56,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-17 00:47:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:56,840 INFO L225 Difference]: With dead ends: 183 [2025-03-17 00:47:56,840 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 00:47:56,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 00:47:56,845 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:56,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:47:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 00:47:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 00:47:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 00:47:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 147 transitions. [2025-03-17 00:47:56,884 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 147 transitions. Word has length 204 [2025-03-17 00:47:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:56,884 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 147 transitions. [2025-03-17 00:47:56,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-17 00:47:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 147 transitions. [2025-03-17 00:47:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 00:47:56,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:56,887 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:47:56,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:47:57,093 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 00:47:57,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:57,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash -453590878, now seen corresponding path program 1 times [2025-03-17 00:47:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:57,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-03-17 00:47:57,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 00:47:57,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 00:47:57,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:47:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065455591] [2025-03-17 00:47:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065455591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:47:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166090057] [2025-03-17 00:47:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:57,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:47:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:57,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:47:57,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:47:57,367 INFO L87 Difference]: Start difference. First operand 91 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:57,474 INFO L93 Difference]: Finished difference Result 271 states and 439 transitions. [2025-03-17 00:47:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:47:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-17 00:47:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:57,478 INFO L225 Difference]: With dead ends: 271 [2025-03-17 00:47:57,480 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 00:47:57,481 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 00:47:57,482 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:57,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 283 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:47:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 00:47:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2025-03-17 00:47:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 109 states have internal predecessors, (157), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 00:47:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 289 transitions. [2025-03-17 00:47:57,519 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 289 transitions. Word has length 205 [2025-03-17 00:47:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:57,519 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 289 transitions. [2025-03-17 00:47:57,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 289 transitions. [2025-03-17 00:47:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 00:47:57,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:57,525 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:47:57,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:47:57,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:57,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash -912573605, now seen corresponding path program 1 times [2025-03-17 00:47:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349231256] [2025-03-17 00:47:57,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:57,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 00:47:57,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 00:47:57,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:57,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:47:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:57,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349231256] [2025-03-17 00:47:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349231256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:57,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:47:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663670695] [2025-03-17 00:47:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:57,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:47:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:57,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:47:57,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:47:57,693 INFO L87 Difference]: Start difference. First operand 178 states and 289 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:57,739 INFO L93 Difference]: Finished difference Result 431 states and 695 transitions. [2025-03-17 00:47:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:47:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 00:47:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:57,742 INFO L225 Difference]: With dead ends: 431 [2025-03-17 00:47:57,742 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 00:47:57,743 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 00:47:57,743 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 51 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:57,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 277 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:47:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 00:47:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2025-03-17 00:47:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 177 states have internal predecessors, (260), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:47:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 400 transitions. [2025-03-17 00:47:57,775 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 400 transitions. Word has length 206 [2025-03-17 00:47:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:57,776 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 400 transitions. [2025-03-17 00:47:57,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 400 transitions. [2025-03-17 00:47:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 00:47:57,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:57,781 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:47:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:47:57,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -973923947, now seen corresponding path program 1 times [2025-03-17 00:47:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-17 00:47:57,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 00:47:57,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 00:47:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:47:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:47:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:47:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169870035] [2025-03-17 00:47:58,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169870035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:47:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:47:58,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:47:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660683856] [2025-03-17 00:47:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:47:58,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:47:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:47:58,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:47:58,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:47:58,565 INFO L87 Difference]: Start difference. First operand 250 states and 400 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:47:58,867 INFO L93 Difference]: Finished difference Result 915 states and 1463 transitions. [2025-03-17 00:47:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:47:58,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 00:47:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:47:58,874 INFO L225 Difference]: With dead ends: 915 [2025-03-17 00:47:58,874 INFO L226 Difference]: Without dead ends: 666 [2025-03-17 00:47:58,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:47:58,877 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 303 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:47:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 587 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:47:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-17 00:47:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 517. [2025-03-17 00:47:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 368 states have (on average 1.4673913043478262) internal successors, (540), 372 states have internal predecessors, (540), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 00:47:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 820 transitions. [2025-03-17 00:47:58,937 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 820 transitions. Word has length 206 [2025-03-17 00:47:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:47:58,937 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 820 transitions. [2025-03-17 00:47:58,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:47:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 820 transitions. [2025-03-17 00:47:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 00:47:58,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:47:58,939 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:47:58,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:47:58,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:47:58,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:47:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1267326954, now seen corresponding path program 1 times [2025-03-17 00:47:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:47:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592195320] [2025-03-17 00:47:58,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:47:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:47:58,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 00:47:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 00:47:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:47:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:48:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592195320] [2025-03-17 00:48:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592195320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:48:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218818028] [2025-03-17 00:48:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:48:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:03,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:48:03,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:48:03,773 INFO L87 Difference]: Start difference. First operand 517 states and 820 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:04,474 INFO L93 Difference]: Finished difference Result 775 states and 1219 transitions. [2025-03-17 00:48:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:48:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 00:48:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:04,481 INFO L225 Difference]: With dead ends: 775 [2025-03-17 00:48:04,481 INFO L226 Difference]: Without dead ends: 773 [2025-03-17 00:48:04,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:48:04,482 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 183 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:04,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 600 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:48:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-17 00:48:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 567. [2025-03-17 00:48:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 418 states have (on average 1.4808612440191387) internal successors, (619), 422 states have internal predecessors, (619), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-17 00:48:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 899 transitions. [2025-03-17 00:48:04,537 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 899 transitions. Word has length 206 [2025-03-17 00:48:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:04,540 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 899 transitions. [2025-03-17 00:48:04,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 899 transitions. [2025-03-17 00:48:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 00:48:04,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:04,543 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:48:04,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1676151179, now seen corresponding path program 1 times [2025-03-17 00:48:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:04,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567918380] [2025-03-17 00:48:04,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:04,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 00:48:04,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 00:48:04,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:04,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:48:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567918380] [2025-03-17 00:48:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567918380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:48:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901370685] [2025-03-17 00:48:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:48:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:04,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:48:04,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:48:04,834 INFO L87 Difference]: Start difference. First operand 567 states and 899 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:04,957 INFO L93 Difference]: Finished difference Result 1625 states and 2578 transitions. [2025-03-17 00:48:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:48:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-17 00:48:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:04,970 INFO L225 Difference]: With dead ends: 1625 [2025-03-17 00:48:04,970 INFO L226 Difference]: Without dead ends: 1059 [2025-03-17 00:48:04,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:48:04,975 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 87 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:04,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 302 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:48:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-03-17 00:48:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2025-03-17 00:48:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 760 states have (on average 1.4407894736842106) internal successors, (1095), 768 states have internal predecessors, (1095), 280 states have call successors, (280), 16 states have call predecessors, (280), 16 states have return successors, (280), 272 states have call predecessors, (280), 280 states have call successors, (280) [2025-03-17 00:48:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1655 transitions. [2025-03-17 00:48:05,077 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1655 transitions. Word has length 206 [2025-03-17 00:48:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1655 transitions. [2025-03-17 00:48:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1655 transitions. [2025-03-17 00:48:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 00:48:05,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:05,081 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:05,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:48:05,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1118305408, now seen corresponding path program 1 times [2025-03-17 00:48:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524911724] [2025-03-17 00:48:05,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:05,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:48:05,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:48:05,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:48:05,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524911724] [2025-03-17 00:48:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524911724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:05,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:05,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:48:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49244419] [2025-03-17 00:48:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:05,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:48:05,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:05,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:48:05,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:48:05,181 INFO L87 Difference]: Start difference. First operand 1057 states and 1655 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:05,286 INFO L93 Difference]: Finished difference Result 2155 states and 3342 transitions. [2025-03-17 00:48:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:48:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-17 00:48:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:05,297 INFO L225 Difference]: With dead ends: 2155 [2025-03-17 00:48:05,297 INFO L226 Difference]: Without dead ends: 1099 [2025-03-17 00:48:05,302 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 00:48:05,302 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:05,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 325 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:48:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-17 00:48:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 907. [2025-03-17 00:48:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 626 states have (on average 1.3817891373801916) internal successors, (865), 626 states have internal predecessors, (865), 264 states have call successors, (264), 16 states have call predecessors, (264), 16 states have return successors, (264), 264 states have call predecessors, (264), 264 states have call successors, (264) [2025-03-17 00:48:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1393 transitions. [2025-03-17 00:48:05,398 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1393 transitions. Word has length 207 [2025-03-17 00:48:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1393 transitions. [2025-03-17 00:48:05,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1393 transitions. [2025-03-17 00:48:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 00:48:05,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:05,402 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:05,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:48:05,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:05,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 899502812, now seen corresponding path program 1 times [2025-03-17 00:48:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359223688] [2025-03-17 00:48:05,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:48:05,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:48:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:48:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359223688] [2025-03-17 00:48:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359223688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:48:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:48:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:48:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752784167] [2025-03-17 00:48:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:48:05,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:48:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:05,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:48:05,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:48:05,610 INFO L87 Difference]: Start difference. First operand 907 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:48:05,995 INFO L93 Difference]: Finished difference Result 1815 states and 2807 transitions. [2025-03-17 00:48:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:48:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-17 00:48:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:48:06,005 INFO L225 Difference]: With dead ends: 1815 [2025-03-17 00:48:06,005 INFO L226 Difference]: Without dead ends: 1327 [2025-03-17 00:48:06,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:48:06,007 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 215 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:48:06,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 497 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:48:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-03-17 00:48:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1278. [2025-03-17 00:48:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 857 states have (on average 1.3640606767794632) internal successors, (1169), 857 states have internal predecessors, (1169), 396 states have call successors, (396), 24 states have call predecessors, (396), 24 states have return successors, (396), 396 states have call predecessors, (396), 396 states have call successors, (396) [2025-03-17 00:48:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1961 transitions. [2025-03-17 00:48:06,123 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1961 transitions. Word has length 207 [2025-03-17 00:48:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:48:06,123 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1961 transitions. [2025-03-17 00:48:06,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:48:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1961 transitions. [2025-03-17 00:48:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 00:48:06,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:48:06,125 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:06,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:48:06,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:48:06,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:48:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2042154787, now seen corresponding path program 1 times [2025-03-17 00:48:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:48:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121535280] [2025-03-17 00:48:06,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:48:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:48:06,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:48:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 51 proven. 135 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2025-03-17 00:48:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:48:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121535280] [2025-03-17 00:48:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121535280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:48:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908624278] [2025-03-17 00:48:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:48:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:48:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:48:07,978 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 00:48:07,980 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 00:48:08,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:48:08,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:48:08,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:48:08,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:48:08,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 00:48:08,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:48:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 900 proven. 321 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-17 00:48:10,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:48:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908624278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:48:33,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:48:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2025-03-17 00:48:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908606461] [2025-03-17 00:48:33,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:48:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 00:48:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:48:33,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 00:48:33,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1279, Unknown=2, NotChecked=0, Total=1722 [2025-03-17 00:48:33,434 INFO L87 Difference]: Start difference. First operand 1278 states and 1961 transitions. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-17 00:48:52,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:48:59,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:49:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:04,015 INFO L93 Difference]: Finished difference Result 3513 states and 5258 transitions. [2025-03-17 00:49:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-17 00:49:04,016 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) Word has length 207 [2025-03-17 00:49:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:04,027 INFO L225 Difference]: With dead ends: 3513 [2025-03-17 00:49:04,027 INFO L226 Difference]: Without dead ends: 2236 [2025-03-17 00:49:04,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4995 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=3362, Invalid=12386, Unknown=2, NotChecked=0, Total=15750 [2025-03-17 00:49:04,034 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1325 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 518 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:04,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1386 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2124 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2025-03-17 00:49:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-03-17 00:49:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1953. [2025-03-17 00:49:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1346 states have (on average 1.3424962852897473) internal successors, (1807), 1350 states have internal predecessors, (1807), 542 states have call successors, (542), 64 states have call predecessors, (542), 64 states have return successors, (542), 538 states have call predecessors, (542), 542 states have call successors, (542) [2025-03-17 00:49:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2891 transitions. [2025-03-17 00:49:04,166 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2891 transitions. Word has length 207 [2025-03-17 00:49:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:04,167 INFO L471 AbstractCegarLoop]: Abstraction has 1953 states and 2891 transitions. [2025-03-17 00:49:04,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (66), 7 states have call predecessors, (66), 10 states have return successors, (66), 10 states have call predecessors, (66), 10 states have call successors, (66) [2025-03-17 00:49:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2891 transitions. [2025-03-17 00:49:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 00:49:04,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:04,169 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:49:04,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:49:04,369 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,SelfDestructingSolverStorable8 [2025-03-17 00:49:04,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:04,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1590791962, now seen corresponding path program 1 times [2025-03-17 00:49:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864384893] [2025-03-17 00:49:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:04,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:49:04,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:49:04,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:04,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-17 00:49:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864384893] [2025-03-17 00:49:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864384893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:49:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207003196] [2025-03-17 00:49:04,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:49:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:49:04,690 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 00:49:04,692 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 00:49:04,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:49:04,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:49:04,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:04,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:49:04,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:49:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 158 proven. 93 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2025-03-17 00:49:05,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:49:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 3 proven. 93 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-17 00:49:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207003196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:49:05,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:49:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-17 00:49:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861846607] [2025-03-17 00:49:05,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:49:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:49:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:05,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:49:05,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:49:05,389 INFO L87 Difference]: Start difference. First operand 1953 states and 2891 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-17 00:49:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:06,113 INFO L93 Difference]: Finished difference Result 4278 states and 6293 transitions. [2025-03-17 00:49:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 00:49:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 207 [2025-03-17 00:49:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:06,127 INFO L225 Difference]: With dead ends: 4278 [2025-03-17 00:49:06,127 INFO L226 Difference]: Without dead ends: 2326 [2025-03-17 00:49:06,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 409 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:49:06,132 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 172 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:06,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 735 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:49:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-03-17 00:49:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1984. [2025-03-17 00:49:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1377 states have (on average 1.3391430646332607) internal successors, (1844), 1381 states have internal predecessors, (1844), 542 states have call successors, (542), 64 states have call predecessors, (542), 64 states have return successors, (542), 538 states have call predecessors, (542), 542 states have call successors, (542) [2025-03-17 00:49:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2928 transitions. [2025-03-17 00:49:06,299 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2928 transitions. Word has length 207 [2025-03-17 00:49:06,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:06,299 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 2928 transitions. [2025-03-17 00:49:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-17 00:49:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2928 transitions. [2025-03-17 00:49:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 00:49:06,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:06,302 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:49:06,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:49:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:49:06,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1297388955, now seen corresponding path program 1 times [2025-03-17 00:49:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761523370] [2025-03-17 00:49:06,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:06,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 00:49:06,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 00:49:06,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:06,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:49:06,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:06,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761523370] [2025-03-17 00:49:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761523370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:49:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:49:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:49:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163279343] [2025-03-17 00:49:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:49:06,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:49:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:06,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:49:06,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:49:06,610 INFO L87 Difference]: Start difference. First operand 1984 states and 2928 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:49:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:49:06,724 INFO L93 Difference]: Finished difference Result 3707 states and 5510 transitions. [2025-03-17 00:49:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:49:06,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-17 00:49:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:49:06,735 INFO L225 Difference]: With dead ends: 3707 [2025-03-17 00:49:06,735 INFO L226 Difference]: Without dead ends: 1656 [2025-03-17 00:49:06,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 00:49:06,741 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 138 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:49:06,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 322 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:49:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-17 00:49:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1654. [2025-03-17 00:49:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1140 states have (on average 1.343859649122807) internal successors, (1532), 1142 states have internal predecessors, (1532), 469 states have call successors, (469), 44 states have call predecessors, (469), 44 states have return successors, (469), 467 states have call predecessors, (469), 469 states have call successors, (469) [2025-03-17 00:49:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2470 transitions. [2025-03-17 00:49:06,860 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2470 transitions. Word has length 207 [2025-03-17 00:49:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:49:06,860 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2470 transitions. [2025-03-17 00:49:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:49:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2470 transitions. [2025-03-17 00:49:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-17 00:49:06,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:49:06,862 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:49:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:49:06,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:49:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:49:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1947255493, now seen corresponding path program 1 times [2025-03-17 00:49:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:49:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445273543] [2025-03-17 00:49:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:49:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:49:06,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 00:49:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 00:49:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:49:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:49:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:49:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:49:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445273543] [2025-03-17 00:49:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445273543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:49:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:49:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:49:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526279069] [2025-03-17 00:49:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:49:18,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:49:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:49:18,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:49:18,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:49:18,110 INFO L87 Difference]: Start difference. First operand 1654 states and 2470 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)