./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_net_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_net_1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:30:31,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:30:32,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:30:32,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:30:32,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:30:32,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:30:32,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:30:32,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:30:32,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:30:32,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:30:32,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:30:32,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:30:32,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:30:32,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:30:32,042 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:30:32,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:30:32,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:30:32,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:32,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:30:32,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:32,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:30:32,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:30:32,045 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-jdk21/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 -> de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 [2025-01-09 00:30:32,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:30:32,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:30:32,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:30:32,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:30:32,238 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:30:32,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_net_1.c [2025-01-09 00:30:33,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbc45278/275df5ba21494258b2224584be8c52a1/FLAG08215302b [2025-01-09 00:30:33,988 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:30:33,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2025-01-09 00:30:34,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbc45278/275df5ba21494258b2224584be8c52a1/FLAG08215302b [2025-01-09 00:30:34,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9dbc45278/275df5ba21494258b2224584be8c52a1 [2025-01-09 00:30:34,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:30:34,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:30:34,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:30:34,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:30:34,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:30:34,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:30:34" (1/1) ... [2025-01-09 00:30:34,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39709032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:34, skipping insertion in model container [2025-01-09 00:30:34,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:30:34" (1/1) ... [2025-01-09 00:30:34,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:30:35,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2025-01-09 00:30:35,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:30:35,683 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:30:36,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2025-01-09 00:30:36,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:30:36,270 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:30:36,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36 WrapperNode [2025-01-09 00:30:36,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:30:36,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:30:36,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:30:36,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:30:36,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:36,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,123 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53156 [2025-01-09 00:30:37,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:30:37,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:30:37,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:30:37,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:30:37,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,490 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-01-09 00:30:37,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:37,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:38,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:38,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:38,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:38,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:30:38,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:30:38,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:30:38,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:30:38,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (1/1) ... [2025-01-09 00:30:38,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:38,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:38,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:30:38,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:30:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:30:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:30:38,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:30:38,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:30:38,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:30:38,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:30:50,276 INFO L? ?]: Removed 10714 outVars from TransFormulas that were not future-live. [2025-01-09 00:30:50,276 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:30:50,445 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:30:50,445 INFO L312 CfgBuilder]: Removed 1130 assume(true) statements. [2025-01-09 00:30:50,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:30:50 BoogieIcfgContainer [2025-01-09 00:30:50,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:30:50,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:30:50,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:30:50,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:30:50,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:30:34" (1/3) ... [2025-01-09 00:30:50,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426e31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:30:50, skipping insertion in model container [2025-01-09 00:30:50,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:36" (2/3) ... [2025-01-09 00:30:50,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426e31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:30:50, skipping insertion in model container [2025-01-09 00:30:50,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:30:50" (3/3) ... [2025-01-09 00:30:50,459 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2025-01-09 00:30:50,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:30:50,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_net_1.c that has 1 procedures, 9211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:30:50,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:30:50,702 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;@38135071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:30:50,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:30:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 9211 states, 9209 states have (on average 1.999348463459659) internal successors, (18412), 9210 states have internal predecessors, (18412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 00:30:50,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:50,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:50,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash 234285221, now seen corresponding path program 1 times [2025-01-09 00:30:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999436579] [2025-01-09 00:30:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:50,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 00:30:50,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 00:30:50,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:50,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999436579] [2025-01-09 00:30:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999436579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:30:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848619096] [2025-01-09 00:30:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:30:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:51,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:30:51,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:30:51,023 INFO L87 Difference]: Start difference. First operand has 9211 states, 9209 states have (on average 1.999348463459659) internal successors, (18412), 9210 states have internal predecessors, (18412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:51,255 INFO L93 Difference]: Finished difference Result 17698 states and 35378 transitions. [2025-01-09 00:30:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:30:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 00:30:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:51,290 INFO L225 Difference]: With dead ends: 17698 [2025-01-09 00:30:51,291 INFO L226 Difference]: Without dead ends: 8280 [2025-01-09 00:30:51,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-09 00:30:51,306 INFO L435 NwaCegarLoop]: 14147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:51,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2025-01-09 00:30:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2025-01-09 00:30:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8280 states, 8279 states have (on average 1.5698755888392317) internal successors, (12997), 8279 states have internal predecessors, (12997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2025-01-09 00:30:51,524 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2025-01-09 00:30:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:51,525 INFO L471 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2025-01-09 00:30:51,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2025-01-09 00:30:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 00:30:51,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:51,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:51,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:30:51,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:51,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash -796031279, now seen corresponding path program 1 times [2025-01-09 00:30:51,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:51,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399767574] [2025-01-09 00:30:51,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:51,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:51,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 00:30:51,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 00:30:51,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399767574] [2025-01-09 00:30:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399767574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468527285] [2025-01-09 00:30:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:51,661 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:53,003 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2025-01-09 00:30:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 00:30:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:53,032 INFO L225 Difference]: With dead ends: 16561 [2025-01-09 00:30:53,032 INFO L226 Difference]: Without dead ends: 8283 [2025-01-09 00:30:53,043 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-01-09 00:30:53,044 INFO L435 NwaCegarLoop]: 12996 mSDtfsCounter, 4 mSDsluCounter, 11520 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24516 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:53,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24516 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:30:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-01-09 00:30:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2025-01-09 00:30:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8282 states have (on average 1.569669162038155) internal successors, (13000), 8282 states have internal predecessors, (13000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2025-01-09 00:30:53,302 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2025-01-09 00:30:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:53,302 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2025-01-09 00:30:53,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2025-01-09 00:30:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 00:30:53,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:53,303 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:53,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:30:53,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:53,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash 410869512, now seen corresponding path program 1 times [2025-01-09 00:30:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:53,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477755096] [2025-01-09 00:30:53,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 00:30:53,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 00:30:53,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:53,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477755096] [2025-01-09 00:30:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477755096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590762117] [2025-01-09 00:30:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:53,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:53,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:53,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:53,455 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:54,657 INFO L93 Difference]: Finished difference Result 16569 states and 26005 transitions. [2025-01-09 00:30:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:54,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 00:30:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:54,686 INFO L225 Difference]: With dead ends: 16569 [2025-01-09 00:30:54,686 INFO L226 Difference]: Without dead ends: 8289 [2025-01-09 00:30:54,695 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-01-09 00:30:54,696 INFO L435 NwaCegarLoop]: 12995 mSDtfsCounter, 329 mSDsluCounter, 11197 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 24192 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:54,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 24192 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:30:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2025-01-09 00:30:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 8287. [2025-01-09 00:30:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8286 states have (on average 1.5693941588221096) internal successors, (13004), 8286 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2025-01-09 00:30:54,795 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 15 [2025-01-09 00:30:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:54,796 INFO L471 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2025-01-09 00:30:54,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2025-01-09 00:30:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 00:30:54,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:54,796 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:54,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:30:54,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:54,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash -534352075, now seen corresponding path program 1 times [2025-01-09 00:30:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201175592] [2025-01-09 00:30:54,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:54,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 00:30:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 00:30:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201175592] [2025-01-09 00:30:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201175592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:54,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:54,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889077394] [2025-01-09 00:30:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:54,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:54,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:54,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:54,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:54,889 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:57,523 INFO L93 Difference]: Finished difference Result 16493 states and 25886 transitions. [2025-01-09 00:30:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:57,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 00:30:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:57,622 INFO L225 Difference]: With dead ends: 16493 [2025-01-09 00:30:57,627 INFO L226 Difference]: Without dead ends: 8167 [2025-01-09 00:30:57,633 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-01-09 00:30:57,634 INFO L435 NwaCegarLoop]: 9998 mSDtfsCounter, 10370 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10370 SdHoareTripleChecker+Valid, 10000 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:57,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10370 Valid, 10000 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:30:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2025-01-09 00:30:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8165. [2025-01-09 00:30:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8165 states, 8164 states have (on average 1.5165360117589417) internal successors, (12381), 8164 states have internal predecessors, (12381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 12381 transitions. [2025-01-09 00:30:57,761 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 12381 transitions. Word has length 19 [2025-01-09 00:30:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:57,762 INFO L471 AbstractCegarLoop]: Abstraction has 8165 states and 12381 transitions. [2025-01-09 00:30:57,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 12381 transitions. [2025-01-09 00:30:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 00:30:57,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:57,763 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:57,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:30:57,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:57,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash 950806933, now seen corresponding path program 1 times [2025-01-09 00:30:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987576241] [2025-01-09 00:30:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:57,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 00:30:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 00:30:57,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:57,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987576241] [2025-01-09 00:30:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987576241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:57,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:57,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186046286] [2025-01-09 00:30:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:57,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:57,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:57,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:57,868 INFO L87 Difference]: Start difference. First operand 8165 states and 12381 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:00,474 INFO L93 Difference]: Finished difference Result 24489 states and 37137 transitions. [2025-01-09 00:31:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 00:31:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:00,521 INFO L225 Difference]: With dead ends: 24489 [2025-01-09 00:31:00,522 INFO L226 Difference]: Without dead ends: 16277 [2025-01-09 00:31:00,532 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-01-09 00:31:00,532 INFO L435 NwaCegarLoop]: 10924 mSDtfsCounter, 10931 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10931 SdHoareTripleChecker+Valid, 21805 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:00,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10931 Valid, 21805 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:31:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16277 states. [2025-01-09 00:31:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16277 to 14963. [2025-01-09 00:31:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14963 states, 14962 states have (on average 1.5566100788664616) internal successors, (23290), 14962 states have internal predecessors, (23290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14963 states to 14963 states and 23290 transitions. [2025-01-09 00:31:00,707 INFO L78 Accepts]: Start accepts. Automaton has 14963 states and 23290 transitions. Word has length 23 [2025-01-09 00:31:00,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:00,707 INFO L471 AbstractCegarLoop]: Abstraction has 14963 states and 23290 transitions. [2025-01-09 00:31:00,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 14963 states and 23290 transitions. [2025-01-09 00:31:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 00:31:00,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:00,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:31:00,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:31:00,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -780564890, now seen corresponding path program 1 times [2025-01-09 00:31:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410605658] [2025-01-09 00:31:00,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:00,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 00:31:00,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 00:31:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410605658] [2025-01-09 00:31:00,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410605658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:00,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159164110] [2025-01-09 00:31:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:00,817 INFO L87 Difference]: Start difference. First operand 14963 states and 23290 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:04,905 INFO L93 Difference]: Finished difference Result 37763 states and 58560 transitions. [2025-01-09 00:31:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 00:31:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:04,961 INFO L225 Difference]: With dead ends: 37763 [2025-01-09 00:31:04,962 INFO L226 Difference]: Without dead ends: 22521 [2025-01-09 00:31:04,978 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-01-09 00:31:04,979 INFO L435 NwaCegarLoop]: 10503 mSDtfsCounter, 10112 mSDsluCounter, 9629 mSDsCounter, 0 mSdLazyCounter, 4519 mSolverCounterSat, 1455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10112 SdHoareTripleChecker+Valid, 20132 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1455 IncrementalHoareTripleChecker+Valid, 4519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:04,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10112 Valid, 20132 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1455 Valid, 4519 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 00:31:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22521 states. [2025-01-09 00:31:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22521 to 21281. [2025-01-09 00:31:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21281 states, 21280 states have (on average 1.5518796992481203) internal successors, (33024), 21280 states have internal predecessors, (33024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21281 states to 21281 states and 33024 transitions. [2025-01-09 00:31:05,205 INFO L78 Accepts]: Start accepts. Automaton has 21281 states and 33024 transitions. Word has length 25 [2025-01-09 00:31:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:05,205 INFO L471 AbstractCegarLoop]: Abstraction has 21281 states and 33024 transitions. [2025-01-09 00:31:05,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21281 states and 33024 transitions. [2025-01-09 00:31:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 00:31:05,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:05,208 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-01-09 00:31:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:31:05,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:05,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash -808064289, now seen corresponding path program 1 times [2025-01-09 00:31:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000538563] [2025-01-09 00:31:05,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:05,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 00:31:05,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 00:31:05,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:05,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:05,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:05,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000538563] [2025-01-09 00:31:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000538563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:05,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:05,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326302996] [2025-01-09 00:31:05,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:05,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:05,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:05,306 INFO L87 Difference]: Start difference. First operand 21281 states and 33024 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:10,040 INFO L93 Difference]: Finished difference Result 63807 states and 99006 transitions. [2025-01-09 00:31:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 00:31:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:10,145 INFO L225 Difference]: With dead ends: 63807 [2025-01-09 00:31:10,145 INFO L226 Difference]: Without dead ends: 42529 [2025-01-09 00:31:10,164 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-01-09 00:31:10,165 INFO L435 NwaCegarLoop]: 21590 mSDtfsCounter, 10226 mSDsluCounter, 9573 mSDsCounter, 0 mSdLazyCounter, 6371 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10226 SdHoareTripleChecker+Valid, 31163 SdHoareTripleChecker+Invalid, 7519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 6371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:10,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10226 Valid, 31163 Invalid, 7519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 6371 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:31:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42529 states. [2025-01-09 00:31:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42529 to 40445. [2025-01-09 00:31:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40445 states, 40444 states have (on average 1.5746464246859855) internal successors, (63685), 40444 states have internal predecessors, (63685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40445 states to 40445 states and 63685 transitions. [2025-01-09 00:31:10,580 INFO L78 Accepts]: Start accepts. Automaton has 40445 states and 63685 transitions. Word has length 30 [2025-01-09 00:31:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:10,580 INFO L471 AbstractCegarLoop]: Abstraction has 40445 states and 63685 transitions. [2025-01-09 00:31:10,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 40445 states and 63685 transitions. [2025-01-09 00:31:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 00:31:10,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:10,581 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:10,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:31:10,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:10,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2143047106, now seen corresponding path program 1 times [2025-01-09 00:31:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:10,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895667768] [2025-01-09 00:31:10,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:10,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 00:31:10,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 00:31:10,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:10,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:10,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895667768] [2025-01-09 00:31:10,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895667768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:10,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:10,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:10,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34278727] [2025-01-09 00:31:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:10,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:10,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:10,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:10,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:10,686 INFO L87 Difference]: Start difference. First operand 40445 states and 63685 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:11,856 INFO L93 Difference]: Finished difference Result 80919 states and 127422 transitions. [2025-01-09 00:31:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:11,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 00:31:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:12,055 INFO L225 Difference]: With dead ends: 80919 [2025-01-09 00:31:12,056 INFO L226 Difference]: Without dead ends: 40477 [2025-01-09 00:31:12,070 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-01-09 00:31:12,070 INFO L435 NwaCegarLoop]: 12342 mSDtfsCounter, 305 mSDsluCounter, 10699 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 23041 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:12,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 23041 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:31:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40477 states. [2025-01-09 00:31:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40477 to 40475. [2025-01-09 00:31:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40475 states, 40474 states have (on average 1.5742204872263676) internal successors, (63715), 40474 states have internal predecessors, (63715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40475 states to 40475 states and 63715 transitions. [2025-01-09 00:31:12,431 INFO L78 Accepts]: Start accepts. Automaton has 40475 states and 63715 transitions. Word has length 36 [2025-01-09 00:31:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:12,431 INFO L471 AbstractCegarLoop]: Abstraction has 40475 states and 63715 transitions. [2025-01-09 00:31:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40475 states and 63715 transitions. [2025-01-09 00:31:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 00:31:12,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:12,435 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:31:12,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:12,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash -465397577, now seen corresponding path program 1 times [2025-01-09 00:31:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559450237] [2025-01-09 00:31:12,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:12,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 00:31:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 00:31:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:12,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559450237] [2025-01-09 00:31:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559450237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012576628] [2025-01-09 00:31:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:12,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:12,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:12,500 INFO L87 Difference]: Start difference. First operand 40475 states and 63715 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:15,427 INFO L93 Difference]: Finished difference Result 109023 states and 171833 transitions. [2025-01-09 00:31:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:15,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 00:31:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:15,522 INFO L225 Difference]: With dead ends: 109023 [2025-01-09 00:31:15,522 INFO L226 Difference]: Without dead ends: 68501 [2025-01-09 00:31:15,554 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-01-09 00:31:15,555 INFO L435 NwaCegarLoop]: 10924 mSDtfsCounter, 10915 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10915 SdHoareTripleChecker+Valid, 21805 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10915 Valid, 21805 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:31:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68501 states. [2025-01-09 00:31:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68501 to 66771. [2025-01-09 00:31:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66771 states, 66770 states have (on average 1.5851280515201438) internal successors, (105839), 66770 states have internal predecessors, (105839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66771 states to 66771 states and 105839 transitions. [2025-01-09 00:31:16,359 INFO L78 Accepts]: Start accepts. Automaton has 66771 states and 105839 transitions. Word has length 39 [2025-01-09 00:31:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:16,359 INFO L471 AbstractCegarLoop]: Abstraction has 66771 states and 105839 transitions. [2025-01-09 00:31:16,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 66771 states and 105839 transitions. [2025-01-09 00:31:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 00:31:16,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:16,359 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:31:16,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:16,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1603165518, now seen corresponding path program 1 times [2025-01-09 00:31:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:16,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130847320] [2025-01-09 00:31:16,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:16,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 00:31:16,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 00:31:16,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:16,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130847320] [2025-01-09 00:31:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130847320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765333564] [2025-01-09 00:31:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:16,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:16,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:16,434 INFO L87 Difference]: Start difference. First operand 66771 states and 105839 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:17,702 INFO L93 Difference]: Finished difference Result 129327 states and 204980 transitions. [2025-01-09 00:31:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:17,702 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 00:31:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:17,805 INFO L225 Difference]: With dead ends: 129327 [2025-01-09 00:31:17,805 INFO L226 Difference]: Without dead ends: 62559 [2025-01-09 00:31:17,854 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-01-09 00:31:17,855 INFO L435 NwaCegarLoop]: 12047 mSDtfsCounter, 10323 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10323 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:17,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10323 Valid, 12598 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:31:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62559 states. [2025-01-09 00:31:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62559 to 62557. [2025-01-09 00:31:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62557 states, 62556 states have (on average 1.5842285312360125) internal successors, (99103), 62556 states have internal predecessors, (99103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62557 states to 62557 states and 99103 transitions. [2025-01-09 00:31:18,727 INFO L78 Accepts]: Start accepts. Automaton has 62557 states and 99103 transitions. Word has length 46 [2025-01-09 00:31:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:18,727 INFO L471 AbstractCegarLoop]: Abstraction has 62557 states and 99103 transitions. [2025-01-09 00:31:18,727 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 62557 states and 99103 transitions. [2025-01-09 00:31:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 00:31:18,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:18,729 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:31:18,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:18,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash -99927523, now seen corresponding path program 1 times [2025-01-09 00:31:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:18,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734987335] [2025-01-09 00:31:18,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:18,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:18,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 00:31:18,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 00:31:18,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:18,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:18,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734987335] [2025-01-09 00:31:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734987335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:18,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:31:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109984864] [2025-01-09 00:31:18,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:18,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:31:18,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:18,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:31:18,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:31:18,920 INFO L87 Difference]: Start difference. First operand 62557 states and 99103 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:22,973 INFO L93 Difference]: Finished difference Result 119614 states and 189347 transitions. [2025-01-09 00:31:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:31:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 00:31:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:23,058 INFO L225 Difference]: With dead ends: 119614 [2025-01-09 00:31:23,058 INFO L226 Difference]: Without dead ends: 62793 [2025-01-09 00:31:23,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:31:23,098 INFO L435 NwaCegarLoop]: 9462 mSDtfsCounter, 19672 mSDsluCounter, 9233 mSDsCounter, 0 mSdLazyCounter, 4620 mSolverCounterSat, 2448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19672 SdHoareTripleChecker+Valid, 18695 SdHoareTripleChecker+Invalid, 7068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2448 IncrementalHoareTripleChecker+Valid, 4620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:23,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19672 Valid, 18695 Invalid, 7068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2448 Valid, 4620 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-09 00:31:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62793 states. [2025-01-09 00:31:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62793 to 60395. [2025-01-09 00:31:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60395 states, 60394 states have (on average 1.5627380203331456) internal successors, (94380), 60394 states have internal predecessors, (94380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60395 states to 60395 states and 94380 transitions. [2025-01-09 00:31:23,839 INFO L78 Accepts]: Start accepts. Automaton has 60395 states and 94380 transitions. Word has length 52 [2025-01-09 00:31:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:23,839 INFO L471 AbstractCegarLoop]: Abstraction has 60395 states and 94380 transitions. [2025-01-09 00:31:23,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 60395 states and 94380 transitions. [2025-01-09 00:31:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 00:31:23,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:23,840 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:31:23,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1173023837, now seen corresponding path program 1 times [2025-01-09 00:31:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002290432] [2025-01-09 00:31:23,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:23,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 00:31:23,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 00:31:23,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:23,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002290432] [2025-01-09 00:31:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002290432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348512644] [2025-01-09 00:31:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:23,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:23,923 INFO L87 Difference]: Start difference. First operand 60395 states and 94380 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:25,513 INFO L93 Difference]: Finished difference Result 120432 states and 188193 transitions. [2025-01-09 00:31:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 00:31:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:25,580 INFO L225 Difference]: With dead ends: 120432 [2025-01-09 00:31:25,580 INFO L226 Difference]: Without dead ends: 60457 [2025-01-09 00:31:25,599 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-01-09 00:31:25,599 INFO L435 NwaCegarLoop]: 11637 mSDtfsCounter, 277 mSDsluCounter, 10274 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 21911 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 21911 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:31:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60457 states. [2025-01-09 00:31:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60457 to 60455. [2025-01-09 00:31:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60455 states, 60454 states have (on average 1.5621795083865417) internal successors, (94440), 60454 states have internal predecessors, (94440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60455 states to 60455 states and 94440 transitions. [2025-01-09 00:31:26,346 INFO L78 Accepts]: Start accepts. Automaton has 60455 states and 94440 transitions. Word has length 53 [2025-01-09 00:31:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 60455 states and 94440 transitions. [2025-01-09 00:31:26,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 60455 states and 94440 transitions. [2025-01-09 00:31:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 00:31:26,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:26,348 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:31:26,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1630539099, now seen corresponding path program 1 times [2025-01-09 00:31:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824767164] [2025-01-09 00:31:26,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:26,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 00:31:26,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 00:31:26,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:26,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824767164] [2025-01-09 00:31:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824767164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279930306] [2025-01-09 00:31:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:26,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:26,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:26,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:26,468 INFO L87 Difference]: Start difference. First operand 60455 states and 94440 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:29,424 INFO L93 Difference]: Finished difference Result 110047 states and 171350 transitions. [2025-01-09 00:31:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:29,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 00:31:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:29,495 INFO L225 Difference]: With dead ends: 110047 [2025-01-09 00:31:29,495 INFO L226 Difference]: Without dead ends: 61421 [2025-01-09 00:31:29,527 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-01-09 00:31:29,528 INFO L435 NwaCegarLoop]: 10159 mSDtfsCounter, 9658 mSDsluCounter, 9402 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9658 SdHoareTripleChecker+Valid, 19561 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:29,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9658 Valid, 19561 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1080 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:31:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61421 states. [2025-01-09 00:31:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61421 to 60199. [2025-01-09 00:31:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60199 states, 60198 states have (on average 1.5518123525698528) internal successors, (93416), 60198 states have internal predecessors, (93416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60199 states to 60199 states and 93416 transitions. [2025-01-09 00:31:30,148 INFO L78 Accepts]: Start accepts. Automaton has 60199 states and 93416 transitions. Word has length 58 [2025-01-09 00:31:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 60199 states and 93416 transitions. [2025-01-09 00:31:30,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 60199 states and 93416 transitions. [2025-01-09 00:31:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 00:31:30,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:30,148 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:30,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:31:30,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:30,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash 407496048, now seen corresponding path program 1 times [2025-01-09 00:31:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983681454] [2025-01-09 00:31:30,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:30,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 00:31:30,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 00:31:30,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:30,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983681454] [2025-01-09 00:31:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983681454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:30,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:30,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541411419] [2025-01-09 00:31:30,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:30,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:30,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:30,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:30,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:30,382 INFO L87 Difference]: Start difference. First operand 60199 states and 93416 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:33,684 INFO L93 Difference]: Finished difference Result 122230 states and 188541 transitions. [2025-01-09 00:31:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 00:31:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:33,764 INFO L225 Difference]: With dead ends: 122230 [2025-01-09 00:31:33,764 INFO L226 Difference]: Without dead ends: 62411 [2025-01-09 00:31:33,803 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-01-09 00:31:33,804 INFO L435 NwaCegarLoop]: 10086 mSDtfsCounter, 9795 mSDsluCounter, 9166 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 19252 SdHoareTripleChecker+Invalid, 4805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:33,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 19252 Invalid, 4805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 00:31:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62411 states. [2025-01-09 00:31:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62411 to 59893. [2025-01-09 00:31:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59893 states, 59892 states have (on average 1.5482702197288452) internal successors, (92729), 59892 states have internal predecessors, (92729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59893 states to 59893 states and 92729 transitions. [2025-01-09 00:31:34,644 INFO L78 Accepts]: Start accepts. Automaton has 59893 states and 92729 transitions. Word has length 64 [2025-01-09 00:31:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:34,645 INFO L471 AbstractCegarLoop]: Abstraction has 59893 states and 92729 transitions. [2025-01-09 00:31:34,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 59893 states and 92729 transitions. [2025-01-09 00:31:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 00:31:34,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:34,646 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:34,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:31:34,647 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:34,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1676241921, now seen corresponding path program 1 times [2025-01-09 00:31:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:34,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887075652] [2025-01-09 00:31:34,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 00:31:34,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 00:31:34,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:34,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887075652] [2025-01-09 00:31:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887075652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:34,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204512471] [2025-01-09 00:31:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:34,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:34,778 INFO L87 Difference]: Start difference. First operand 59893 states and 92729 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:39,174 INFO L93 Difference]: Finished difference Result 97852 states and 150310 transitions. [2025-01-09 00:31:39,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:39,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 00:31:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:39,253 INFO L225 Difference]: With dead ends: 97852 [2025-01-09 00:31:39,253 INFO L226 Difference]: Without dead ends: 72844 [2025-01-09 00:31:39,270 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-01-09 00:31:39,270 INFO L435 NwaCegarLoop]: 19384 mSDtfsCounter, 9130 mSDsluCounter, 8888 mSDsCounter, 0 mSdLazyCounter, 5614 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9130 SdHoareTripleChecker+Valid, 28272 SdHoareTripleChecker+Invalid, 6248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 5614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:39,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9130 Valid, 28272 Invalid, 6248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 5614 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:31:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72844 states. [2025-01-09 00:31:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72844 to 71072. [2025-01-09 00:31:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71072 states, 71071 states have (on average 1.5502807052102827) internal successors, (110180), 71071 states have internal predecessors, (110180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71072 states to 71072 states and 110180 transitions. [2025-01-09 00:31:40,092 INFO L78 Accepts]: Start accepts. Automaton has 71072 states and 110180 transitions. Word has length 74 [2025-01-09 00:31:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:40,092 INFO L471 AbstractCegarLoop]: Abstraction has 71072 states and 110180 transitions. [2025-01-09 00:31:40,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 71072 states and 110180 transitions. [2025-01-09 00:31:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 00:31:40,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:40,094 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:40,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:31:40,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1434430363, now seen corresponding path program 1 times [2025-01-09 00:31:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696276424] [2025-01-09 00:31:40,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:40,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 00:31:40,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 00:31:40,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:40,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:40,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696276424] [2025-01-09 00:31:40,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696276424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381626242] [2025-01-09 00:31:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:40,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:40,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:40,170 INFO L87 Difference]: Start difference. First operand 71072 states and 110180 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:41,475 INFO L93 Difference]: Finished difference Result 138711 states and 215043 transitions. [2025-01-09 00:31:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 00:31:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:41,554 INFO L225 Difference]: With dead ends: 138711 [2025-01-09 00:31:41,554 INFO L226 Difference]: Without dead ends: 68429 [2025-01-09 00:31:41,574 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-01-09 00:31:41,575 INFO L435 NwaCegarLoop]: 11220 mSDtfsCounter, 9552 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9552 SdHoareTripleChecker+Valid, 12029 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:41,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9552 Valid, 12029 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:31:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68429 states. [2025-01-09 00:31:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68429 to 68427. [2025-01-09 00:31:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68427 states, 68426 states have (on average 1.5493671996024903) internal successors, (106017), 68426 states have internal predecessors, (106017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68427 states to 68427 states and 106017 transitions. [2025-01-09 00:31:42,420 INFO L78 Accepts]: Start accepts. Automaton has 68427 states and 106017 transitions. Word has length 81 [2025-01-09 00:31:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 68427 states and 106017 transitions. [2025-01-09 00:31:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68427 states and 106017 transitions. [2025-01-09 00:31:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 00:31:42,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:42,422 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:42,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:31:42,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1868691164, now seen corresponding path program 1 times [2025-01-09 00:31:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120387536] [2025-01-09 00:31:42,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:42,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 00:31:42,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 00:31:42,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:31:42,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:42,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120387536] [2025-01-09 00:31:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120387536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:42,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756159699] [2025-01-09 00:31:42,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:42,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:42,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:42,476 INFO L87 Difference]: Start difference. First operand 68427 states and 106017 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:43,852 INFO L93 Difference]: Finished difference Result 136162 states and 210964 transitions. [2025-01-09 00:31:43,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-01-09 00:31:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:43,950 INFO L225 Difference]: With dead ends: 136162 [2025-01-09 00:31:43,950 INFO L226 Difference]: Without dead ends: 68525 [2025-01-09 00:31:43,979 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-01-09 00:31:43,979 INFO L435 NwaCegarLoop]: 11291 mSDtfsCounter, 276 mSDsluCounter, 10012 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 21303 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:43,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 21303 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:31:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68525 states. [2025-01-09 00:31:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68525 to 68523. [2025-01-09 00:31:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68523 states, 68522 states have (on average 1.5485975307200608) internal successors, (106113), 68522 states have internal predecessors, (106113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68523 states to 68523 states and 106113 transitions. [2025-01-09 00:31:45,208 INFO L78 Accepts]: Start accepts. Automaton has 68523 states and 106113 transitions. Word has length 84 [2025-01-09 00:31:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:45,208 INFO L471 AbstractCegarLoop]: Abstraction has 68523 states and 106113 transitions. [2025-01-09 00:31:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 68523 states and 106113 transitions. [2025-01-09 00:31:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 00:31:45,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:45,210 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:45,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:31:45,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1309826242, now seen corresponding path program 1 times [2025-01-09 00:31:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211890318] [2025-01-09 00:31:45,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:45,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 00:31:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 00:31:45,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:45,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211890318] [2025-01-09 00:31:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211890318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:31:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358048175] [2025-01-09 00:31:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:45,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:31:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:31:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:31:45,351 INFO L87 Difference]: Start difference. First operand 68523 states and 106113 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:48,832 INFO L93 Difference]: Finished difference Result 94207 states and 144749 transitions. [2025-01-09 00:31:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:31:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 00:31:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:48,914 INFO L225 Difference]: With dead ends: 94207 [2025-01-09 00:31:48,914 INFO L226 Difference]: Without dead ends: 69748 [2025-01-09 00:31:48,941 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-01-09 00:31:48,942 INFO L435 NwaCegarLoop]: 18995 mSDtfsCounter, 9021 mSDsluCounter, 8547 mSDsCounter, 0 mSdLazyCounter, 4564 mSolverCounterSat, 724 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9021 SdHoareTripleChecker+Valid, 27542 SdHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 4564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:48,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9021 Valid, 27542 Invalid, 5288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 4564 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 00:31:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69748 states. [2025-01-09 00:31:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69748 to 68515. [2025-01-09 00:31:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68515 states, 68514 states have (on average 1.5480485740140701) internal successors, (106063), 68514 states have internal predecessors, (106063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68515 states to 68515 states and 106063 transitions. [2025-01-09 00:31:49,802 INFO L78 Accepts]: Start accepts. Automaton has 68515 states and 106063 transitions. Word has length 86 [2025-01-09 00:31:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:49,803 INFO L471 AbstractCegarLoop]: Abstraction has 68515 states and 106063 transitions. [2025-01-09 00:31:49,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 68515 states and 106063 transitions. [2025-01-09 00:31:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 00:31:49,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:49,804 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:31:49,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:49,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1491645235, now seen corresponding path program 1 times [2025-01-09 00:31:49,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689471049] [2025-01-09 00:31:49,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:49,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 00:31:49,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 00:31:49,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:49,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689471049] [2025-01-09 00:31:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689471049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:31:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863200896] [2025-01-09 00:31:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:31:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:49,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:31:49,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:31:49,978 INFO L87 Difference]: Start difference. First operand 68515 states and 106063 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:31:54,373 INFO L93 Difference]: Finished difference Result 93487 states and 143691 transitions. [2025-01-09 00:31:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:31:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 00:31:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:31:54,428 INFO L225 Difference]: With dead ends: 93487 [2025-01-09 00:31:54,428 INFO L226 Difference]: Without dead ends: 47058 [2025-01-09 00:31:54,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:31:54,458 INFO L435 NwaCegarLoop]: 8734 mSDtfsCounter, 26541 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 4830 mSolverCounterSat, 2586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26541 SdHoareTripleChecker+Valid, 17101 SdHoareTripleChecker+Invalid, 7416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2586 IncrementalHoareTripleChecker+Valid, 4830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:31:54,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26541 Valid, 17101 Invalid, 7416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2586 Valid, 4830 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:31:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47058 states. [2025-01-09 00:31:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47058 to 45893. [2025-01-09 00:31:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45893 states, 45892 states have (on average 1.5308114704087858) internal successors, (70252), 45892 states have internal predecessors, (70252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45893 states to 45893 states and 70252 transitions. [2025-01-09 00:31:54,952 INFO L78 Accepts]: Start accepts. Automaton has 45893 states and 70252 transitions. Word has length 88 [2025-01-09 00:31:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:31:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 45893 states and 70252 transitions. [2025-01-09 00:31:54,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:31:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45893 states and 70252 transitions. [2025-01-09 00:31:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 00:31:54,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:31:54,955 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:31:54,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:31:54,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:31:54,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:31:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1402745629, now seen corresponding path program 1 times [2025-01-09 00:31:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:31:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920749759] [2025-01-09 00:31:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:31:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:31:54,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 00:31:54,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 00:31:54,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:31:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:31:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:31:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:31:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920749759] [2025-01-09 00:31:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920749759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:31:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:31:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:31:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545467997] [2025-01-09 00:31:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:31:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:31:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:31:55,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:31:55,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:31:55,175 INFO L87 Difference]: Start difference. First operand 45893 states and 70252 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)