./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label03.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/eca-rers2012/Problem13_label03.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 39b8a4ae0f070887d4af4fec410b03e79c801778085245d1dd791c56546c3332 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:50:06,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:50:06,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:50:06,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:50:06,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:50:06,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:50:06,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:50:06,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:50:06,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:50:06,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:50:06,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:50:06,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:50:06,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:50:06,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:50:06,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:50:06,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:50:06,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:50:06,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:50:06,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:06,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:50:06,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:06,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:50:06,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:50:06,432 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 -> 39b8a4ae0f070887d4af4fec410b03e79c801778085245d1dd791c56546c3332 [2025-01-08 23:50:06,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:50:06,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:50:06,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:50:06,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:50:06,652 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:50:06,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label03.c [2025-01-08 23:50:07,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8e3788c/b4591b0287e540f49cb9ebef2271e6c6/FLAG6940ecb36 [2025-01-08 23:50:08,223 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:50:08,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label03.c [2025-01-08 23:50:08,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8e3788c/b4591b0287e540f49cb9ebef2271e6c6/FLAG6940ecb36 [2025-01-08 23:50:08,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee8e3788c/b4591b0287e540f49cb9ebef2271e6c6 [2025-01-08 23:50:08,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:50:08,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:50:08,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:50:08,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:50:08,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:50:08,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:08,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49329503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08, skipping insertion in model container [2025-01-08 23:50:08,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:08,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:50:08,586 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/eca-rers2012/Problem13_label03.c[5036,5049] [2025-01-08 23:50:09,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:50:09,066 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:50:09,082 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/eca-rers2012/Problem13_label03.c[5036,5049] [2025-01-08 23:50:09,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:50:09,374 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:50:09,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09 WrapperNode [2025-01-08 23:50:09,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:50:09,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:50:09,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:50:09,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:50:09,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:09,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:09,850 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:50:09,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:50:09,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:50:09,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:50:09,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:50:09,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:09,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:09,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,136 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-08 23:50:10,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:50:10,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:50:10,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:50:10,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:50:10,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (1/1) ... [2025-01-08 23:50:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:10,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:10,469 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-08 23:50:10,471 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-08 23:50:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:50:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:50:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:50:10,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:50:10,535 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:50:10,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:50:14,568 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:50:14,569 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:50:14,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:50:14,600 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:50:14,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:50:14 BoogieIcfgContainer [2025-01-08 23:50:14,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:50:14,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:50:14,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:50:14,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:50:14,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:50:08" (1/3) ... [2025-01-08 23:50:14,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4d7a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:50:14, skipping insertion in model container [2025-01-08 23:50:14,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:09" (2/3) ... [2025-01-08 23:50:14,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4d7a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:50:14, skipping insertion in model container [2025-01-08 23:50:14,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:50:14" (3/3) ... [2025-01-08 23:50:14,611 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label03.c [2025-01-08 23:50:14,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:50:14,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label03.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:50:14,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:50:14,696 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;@7346eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:50:14,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:50:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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-08 23:50:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 23:50:14,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:14,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:14,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:14,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1410235526, now seen corresponding path program 1 times [2025-01-08 23:50:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696216382] [2025-01-08 23:50:14,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:14,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 23:50:14,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 23:50:14,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:14,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:15,154 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-08 23:50:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696216382] [2025-01-08 23:50:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696216382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913719387] [2025-01-08 23:50:15,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:15,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:15,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:15,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:15,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:15,181 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-08 23:50:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:20,220 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-01-08 23:50:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2025-01-08 23:50:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:20,238 INFO L225 Difference]: With dead ends: 3829 [2025-01-08 23:50:20,239 INFO L226 Difference]: Without dead ends: 2664 [2025-01-08 23:50:20,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:50:20,245 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 2725 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:20,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 1059 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-08 23:50:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-01-08 23:50:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-01-08 23:50:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 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-08 23:50:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-01-08 23:50:20,343 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 34 [2025-01-08 23:50:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:20,344 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-01-08 23:50:20,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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-08 23:50:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-01-08 23:50:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-08 23:50:20,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:20,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:20,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:50:20,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1746973952, now seen corresponding path program 1 times [2025-01-08 23:50:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724364737] [2025-01-08 23:50:20,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:20,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-08 23:50:20,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-08 23:50:20,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:20,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 23:50:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724364737] [2025-01-08 23:50:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724364737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:20,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676927244] [2025-01-08 23:50:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:20,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:20,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:20,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:20,630 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-08 23:50:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:23,403 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-01-08 23:50:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:23,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 159 [2025-01-08 23:50:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:23,415 INFO L225 Difference]: With dead ends: 6142 [2025-01-08 23:50:23,415 INFO L226 Difference]: Without dead ends: 4268 [2025-01-08 23:50:23,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 23:50:23,418 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:23,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1189 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:50:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-01-08 23:50:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-01-08 23:50:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 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-08 23:50:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-01-08 23:50:23,470 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 159 [2025-01-08 23:50:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:23,471 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-01-08 23:50:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-08 23:50:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-01-08 23:50:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-08 23:50:23,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:23,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:23,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:50:23,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1518855827, now seen corresponding path program 1 times [2025-01-08 23:50:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:23,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677652497] [2025-01-08 23:50:23,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:23,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-08 23:50:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-08 23:50:23,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:23,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:50:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677652497] [2025-01-08 23:50:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677652497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:23,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570856970] [2025-01-08 23:50:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:23,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:23,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:23,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:23,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:23,652 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-08 23:50:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:26,058 INFO L93 Difference]: Finished difference Result 10897 states and 15274 transitions. [2025-01-08 23:50:26,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:26,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 201 [2025-01-08 23:50:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:26,079 INFO L225 Difference]: With dead ends: 10897 [2025-01-08 23:50:26,079 INFO L226 Difference]: Without dead ends: 7432 [2025-01-08 23:50:26,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 23:50:26,086 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 905 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:26,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 954 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:50:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2025-01-08 23:50:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 7426. [2025-01-08 23:50:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 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-08 23:50:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-01-08 23:50:26,177 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 201 [2025-01-08 23:50:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-01-08 23:50:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-08 23:50:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-01-08 23:50:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-08 23:50:26,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:26,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:50:26,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1830854218, now seen corresponding path program 1 times [2025-01-08 23:50:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436700657] [2025-01-08 23:50:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-08 23:50:26,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-08 23:50:26,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:26,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:50:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436700657] [2025-01-08 23:50:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436700657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036178637] [2025-01-08 23:50:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:26,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:26,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:26,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:26,407 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-08 23:50:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:29,002 INFO L93 Difference]: Finished difference Result 19619 states and 25904 transitions. [2025-01-08 23:50:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 215 [2025-01-08 23:50:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:29,033 INFO L225 Difference]: With dead ends: 19619 [2025-01-08 23:50:29,033 INFO L226 Difference]: Without dead ends: 12982 [2025-01-08 23:50:29,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 23:50:29,039 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:29,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 641 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:50:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2025-01-08 23:50:29,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12975. [2025-01-08 23:50:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2719284723292739) internal successors, (16502), 12974 states have internal predecessors, (16502), 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-08 23:50:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16502 transitions. [2025-01-08 23:50:29,179 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16502 transitions. Word has length 215 [2025-01-08 23:50:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16502 transitions. [2025-01-08 23:50:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-08 23:50:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16502 transitions. [2025-01-08 23:50:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-08 23:50:29,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:29,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:29,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:50:29,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:29,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:29,183 INFO L85 PathProgramCache]: Analyzing trace with hash -610384981, now seen corresponding path program 1 times [2025-01-08 23:50:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231060420] [2025-01-08 23:50:29,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:29,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-08 23:50:29,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-08 23:50:29,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231060420] [2025-01-08 23:50:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231060420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:29,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:29,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:29,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153401089] [2025-01-08 23:50:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:29,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:29,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:29,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:29,350 INFO L87 Difference]: Start difference. First operand 12975 states and 16502 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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-08 23:50:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:34,351 INFO L93 Difference]: Finished difference Result 45030 states and 58434 transitions. [2025-01-08 23:50:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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 231 [2025-01-08 23:50:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:34,410 INFO L225 Difference]: With dead ends: 45030 [2025-01-08 23:50:34,410 INFO L226 Difference]: Without dead ends: 32844 [2025-01-08 23:50:34,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 23:50:34,422 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1623 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 6078 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 6701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 6078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:34,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 1150 Invalid, 6701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 6078 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-08 23:50:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2025-01-08 23:50:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 32694. [2025-01-08 23:50:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32694 states, 32693 states have (on average 1.2306915853546632) internal successors, (40235), 32693 states have internal predecessors, (40235), 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-08 23:50:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 40235 transitions. [2025-01-08 23:50:34,767 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 40235 transitions. Word has length 231 [2025-01-08 23:50:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:34,768 INFO L471 AbstractCegarLoop]: Abstraction has 32694 states and 40235 transitions. [2025-01-08 23:50:34,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 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-08 23:50:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 40235 transitions. [2025-01-08 23:50:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-08 23:50:34,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:34,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:34,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:50:34,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1596512634, now seen corresponding path program 1 times [2025-01-08 23:50:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843918781] [2025-01-08 23:50:34,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:34,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-08 23:50:34,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-08 23:50:34,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:34,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:50:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843918781] [2025-01-08 23:50:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843918781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:35,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683221662] [2025-01-08 23:50:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:35,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:35,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:35,004 INFO L87 Difference]: Start difference. First operand 32694 states and 40235 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-08 23:50:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:37,661 INFO L93 Difference]: Finished difference Result 87418 states and 108585 transitions. [2025-01-08 23:50:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:37,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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 252 [2025-01-08 23:50:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:37,728 INFO L225 Difference]: With dead ends: 87418 [2025-01-08 23:50:37,728 INFO L226 Difference]: Without dead ends: 55513 [2025-01-08 23:50:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08 23:50:37,748 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 859 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:37,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 984 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:50:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55513 states. [2025-01-08 23:50:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55513 to 53148. [2025-01-08 23:50:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53148 states, 53147 states have (on average 1.1822116017837319) internal successors, (62831), 53147 states have internal predecessors, (62831), 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-08 23:50:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53148 states to 53148 states and 62831 transitions. [2025-01-08 23:50:38,327 INFO L78 Accepts]: Start accepts. Automaton has 53148 states and 62831 transitions. Word has length 252 [2025-01-08 23:50:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:38,327 INFO L471 AbstractCegarLoop]: Abstraction has 53148 states and 62831 transitions. [2025-01-08 23:50:38,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 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-08 23:50:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 53148 states and 62831 transitions. [2025-01-08 23:50:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-08 23:50:38,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:38,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:50:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:50:38,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:38,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 543702720, now seen corresponding path program 1 times [2025-01-08 23:50:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582807503] [2025-01-08 23:50:38,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-08 23:50:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-08 23:50:38,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:38,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-08 23:50:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582807503] [2025-01-08 23:50:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582807503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:38,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669874296] [2025-01-08 23:50:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:38,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:38,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:38,624 INFO L87 Difference]: Start difference. First operand 53148 states and 62831 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 23:50:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:41,516 INFO L93 Difference]: Finished difference Result 129915 states and 156298 transitions. [2025-01-08 23:50:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 274 [2025-01-08 23:50:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:41,599 INFO L225 Difference]: With dead ends: 129915 [2025-01-08 23:50:41,599 INFO L226 Difference]: Without dead ends: 77556 [2025-01-08 23:50:41,628 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-08 23:50:41,629 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 889 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:41,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 928 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:50:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77556 states. [2025-01-08 23:50:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77556 to 76759. [2025-01-08 23:50:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76759 states, 76758 states have (on average 1.168829307694312) internal successors, (89717), 76758 states have internal predecessors, (89717), 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-08 23:50:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76759 states to 76759 states and 89717 transitions. [2025-01-08 23:50:42,949 INFO L78 Accepts]: Start accepts. Automaton has 76759 states and 89717 transitions. Word has length 274 [2025-01-08 23:50:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:42,950 INFO L471 AbstractCegarLoop]: Abstraction has 76759 states and 89717 transitions. [2025-01-08 23:50:42,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 23:50:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 76759 states and 89717 transitions. [2025-01-08 23:50:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-01-08 23:50:42,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:42,953 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:50:42,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1136032550, now seen corresponding path program 1 times [2025-01-08 23:50:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:42,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532957779] [2025-01-08 23:50:42,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-08 23:50:42,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-08 23:50:42,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:42,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-08 23:50:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532957779] [2025-01-08 23:50:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532957779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254282162] [2025-01-08 23:50:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:43,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:50:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:43,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:50:43,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:50:43,171 INFO L87 Difference]: Start difference. First operand 76759 states and 89717 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-08 23:50:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:48,659 INFO L93 Difference]: Finished difference Result 205682 states and 242489 transitions. [2025-01-08 23:50:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:50:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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 317 [2025-01-08 23:50:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:48,793 INFO L225 Difference]: With dead ends: 205682 [2025-01-08 23:50:48,793 INFO L226 Difference]: Without dead ends: 129712 [2025-01-08 23:50:48,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-08 23:50:48,832 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1731 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 6628 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 7765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 6628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:48,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 700 Invalid, 7765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 6628 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-08 23:50:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129712 states. [2025-01-08 23:50:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129712 to 126435. [2025-01-08 23:50:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126435 states, 126434 states have (on average 1.1667905784836357) internal successors, (147522), 126434 states have internal predecessors, (147522), 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-08 23:50:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126435 states to 126435 states and 147522 transitions. [2025-01-08 23:50:50,189 INFO L78 Accepts]: Start accepts. Automaton has 126435 states and 147522 transitions. Word has length 317 [2025-01-08 23:50:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:50,190 INFO L471 AbstractCegarLoop]: Abstraction has 126435 states and 147522 transitions. [2025-01-08 23:50:50,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-08 23:50:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 126435 states and 147522 transitions. [2025-01-08 23:50:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-08 23:50:50,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:50,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:50,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:50:50,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:50,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:50,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1788964401, now seen corresponding path program 1 times [2025-01-08 23:50:50,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225722659] [2025-01-08 23:50:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:50,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:50:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:50:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 340 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-08 23:50:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225722659] [2025-01-08 23:50:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225722659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:50,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700026966] [2025-01-08 23:50:50,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:50,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:50,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:50,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:50:50,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:50:50,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:50:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:50:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:50,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:50:50,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-08 23:50:51,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700026966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:51,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:50:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413066814] [2025-01-08 23:50:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:51,330 INFO L87 Difference]: Start difference. First operand 126435 states and 147522 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-08 23:50:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:54,760 INFO L93 Difference]: Finished difference Result 300075 states and 354252 transitions. [2025-01-08 23:50:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 360 [2025-01-08 23:50:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:54,949 INFO L225 Difference]: With dead ends: 300075 [2025-01-08 23:50:54,949 INFO L226 Difference]: Without dead ends: 188607 [2025-01-08 23:50:54,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:54,998 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 736 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:54,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1128 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:50:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188607 states. [2025-01-08 23:50:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188607 to 176800. [2025-01-08 23:50:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176800 states, 176799 states have (on average 1.127093479035515) internal successors, (199269), 176799 states have internal predecessors, (199269), 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-08 23:50:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176800 states to 176800 states and 199269 transitions. [2025-01-08 23:50:57,136 INFO L78 Accepts]: Start accepts. Automaton has 176800 states and 199269 transitions. Word has length 360 [2025-01-08 23:50:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:57,137 INFO L471 AbstractCegarLoop]: Abstraction has 176800 states and 199269 transitions. [2025-01-08 23:50:57,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-08 23:50:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 176800 states and 199269 transitions. [2025-01-08 23:50:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-08 23:50:57,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:57,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:50:57,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:50:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:57,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:57,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash 926892532, now seen corresponding path program 1 times [2025-01-08 23:50:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699292277] [2025-01-08 23:50:57,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:57,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-08 23:50:57,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-08 23:50:57,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 286 proven. 113 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-08 23:50:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699292277] [2025-01-08 23:50:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699292277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503040800] [2025-01-08 23:50:58,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:58,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:58,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:58,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:50:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:50:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-08 23:50:58,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-08 23:50:58,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:58,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:58,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-08 23:50:58,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503040800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:58,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:50:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946250302] [2025-01-08 23:50:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:58,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:58,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:58,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:50:58,632 INFO L87 Difference]: Start difference. First operand 176800 states and 199269 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-08 23:51:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:01,806 INFO L93 Difference]: Finished difference Result 352022 states and 396886 transitions. [2025-01-08 23:51:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 389 [2025-01-08 23:51:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:02,000 INFO L225 Difference]: With dead ends: 352022 [2025-01-08 23:51:02,000 INFO L226 Difference]: Without dead ends: 176011 [2025-01-08 23:51:02,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:51:02,088 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1092 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:02,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1440 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:51:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176011 states. [2025-01-08 23:51:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176011 to 172075. [2025-01-08 23:51:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172075 states, 172074 states have (on average 1.0953078326766392) internal successors, (188474), 172074 states have internal predecessors, (188474), 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-08 23:51:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172075 states to 172075 states and 188474 transitions. [2025-01-08 23:51:03,873 INFO L78 Accepts]: Start accepts. Automaton has 172075 states and 188474 transitions. Word has length 389 [2025-01-08 23:51:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:03,874 INFO L471 AbstractCegarLoop]: Abstraction has 172075 states and 188474 transitions. [2025-01-08 23:51:03,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-08 23:51:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 172075 states and 188474 transitions. [2025-01-08 23:51:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-08 23:51:03,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:03,877 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:03,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:51:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:04,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1019792417, now seen corresponding path program 1 times [2025-01-08 23:51:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889210622] [2025-01-08 23:51:04,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-08 23:51:04,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-08 23:51:04,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:04,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:51:04,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:04,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889210622] [2025-01-08 23:51:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889210622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455291865] [2025-01-08 23:51:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:04,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:04,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:04,504 INFO L87 Difference]: Start difference. First operand 172075 states and 188474 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-08 23:51:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:08,908 INFO L93 Difference]: Finished difference Result 385869 states and 425538 transitions. [2025-01-08 23:51:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 390 [2025-01-08 23:51:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:09,174 INFO L225 Difference]: With dead ends: 385869 [2025-01-08 23:51:09,174 INFO L226 Difference]: Without dead ends: 214583 [2025-01-08 23:51:09,463 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-08 23:51:09,464 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 900 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 947 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 947 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:09,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 910 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [947 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:51:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214583 states. [2025-01-08 23:51:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214583 to 214562. [2025-01-08 23:51:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214562 states, 214561 states have (on average 1.0965459706097567) internal successors, (235276), 214561 states have internal predecessors, (235276), 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-08 23:51:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214562 states to 214562 states and 235276 transitions. [2025-01-08 23:51:11,683 INFO L78 Accepts]: Start accepts. Automaton has 214562 states and 235276 transitions. Word has length 390 [2025-01-08 23:51:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:11,684 INFO L471 AbstractCegarLoop]: Abstraction has 214562 states and 235276 transitions. [2025-01-08 23:51:11,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-08 23:51:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 214562 states and 235276 transitions. [2025-01-08 23:51:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-08 23:51:11,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:11,691 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-08 23:51:11,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:51:11,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1993727737, now seen corresponding path program 1 times [2025-01-08 23:51:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203107066] [2025-01-08 23:51:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:11,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-08 23:51:11,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-08 23:51:11,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:11,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-01-08 23:51:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203107066] [2025-01-08 23:51:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203107066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344513348] [2025-01-08 23:51:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:11,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:11,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:11,850 INFO L87 Difference]: Start difference. First operand 214562 states and 235276 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-08 23:51:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:15,189 INFO L93 Difference]: Finished difference Result 444045 states and 485888 transitions. [2025-01-08 23:51:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 449 [2025-01-08 23:51:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:15,471 INFO L225 Difference]: With dead ends: 444045 [2025-01-08 23:51:15,471 INFO L226 Difference]: Without dead ends: 212949 [2025-01-08 23:51:15,570 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-08 23:51:15,571 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1034 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:15,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1634 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:51:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212949 states. [2025-01-08 23:51:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212949 to 201917. [2025-01-08 23:51:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201917 states, 201916 states have (on average 1.0691673765328156) internal successors, (215882), 201916 states have internal predecessors, (215882), 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-08 23:51:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201917 states to 201917 states and 215882 transitions. [2025-01-08 23:51:17,869 INFO L78 Accepts]: Start accepts. Automaton has 201917 states and 215882 transitions. Word has length 449 [2025-01-08 23:51:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:17,870 INFO L471 AbstractCegarLoop]: Abstraction has 201917 states and 215882 transitions. [2025-01-08 23:51:17,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-08 23:51:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 201917 states and 215882 transitions. [2025-01-08 23:51:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-08 23:51:17,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:17,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:51:17,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash 610984986, now seen corresponding path program 1 times [2025-01-08 23:51:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226822392] [2025-01-08 23:51:17,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:17,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-08 23:51:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-08 23:51:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:51:18,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226822392] [2025-01-08 23:51:18,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226822392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:18,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:18,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:18,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021238369] [2025-01-08 23:51:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:18,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:18,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:18,297 INFO L87 Difference]: Start difference. First operand 201917 states and 215882 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-08 23:51:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:22,894 INFO L93 Difference]: Finished difference Result 440835 states and 473464 transitions. [2025-01-08 23:51:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 482 [2025-01-08 23:51:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:23,188 INFO L225 Difference]: With dead ends: 440835 [2025-01-08 23:51:23,189 INFO L226 Difference]: Without dead ends: 238133 [2025-01-08 23:51:23,279 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-08 23:51:23,280 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 728 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:23,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1851 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:51:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238133 states. [2025-01-08 23:51:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238133 to 234181. [2025-01-08 23:51:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234181 states, 234180 states have (on average 1.0603424716030403) internal successors, (248311), 234180 states have internal predecessors, (248311), 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-08 23:51:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234181 states to 234181 states and 248311 transitions. [2025-01-08 23:51:26,198 INFO L78 Accepts]: Start accepts. Automaton has 234181 states and 248311 transitions. Word has length 482 [2025-01-08 23:51:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 234181 states and 248311 transitions. [2025-01-08 23:51:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-08 23:51:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 234181 states and 248311 transitions. [2025-01-08 23:51:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-08 23:51:26,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:26,219 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:51:26,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:51:26,219 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1015627639, now seen corresponding path program 1 times [2025-01-08 23:51:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:26,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007823504] [2025-01-08 23:51:26,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:26,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-08 23:51:26,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-08 23:51:26,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:26,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:51:26,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:26,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007823504] [2025-01-08 23:51:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007823504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:26,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:26,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549633696] [2025-01-08 23:51:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:26,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:26,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:26,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:26,431 INFO L87 Difference]: Start difference. First operand 234181 states and 248311 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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-08 23:51:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:30,834 INFO L93 Difference]: Finished difference Result 469155 states and 497425 transitions. [2025-01-08 23:51:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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 601 [2025-01-08 23:51:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:31,167 INFO L225 Difference]: With dead ends: 469155 [2025-01-08 23:51:31,168 INFO L226 Difference]: Without dead ends: 235763 [2025-01-08 23:51:31,200 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-08 23:51:31,201 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 717 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:31,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1454 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:51:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235763 states.