./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label37.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/Problem11_label37.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 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:42:29,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:42:29,067 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:42:29,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:42:29,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:42:29,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:42:29,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:42:29,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:42:29,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:42:29,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:42:29,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:42:29,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:42:29,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:42:29,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:42:29,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:29,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:29,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:42:29,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:42:29,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:42:29,106 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 -> 06fd550ecd237ab8f8345f0996e38c68877e3b04d04ee5f9440f9cffb12d9fc8 [2025-01-08 23:42:29,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:42:29,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:42:29,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:42:29,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:42:29,314 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:42:29,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2025-01-08 23:42:30,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dae70df/291548f8ea594274a96da1c79365b18f/FLAG81b0ea016 [2025-01-08 23:42:30,828 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:42:30,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label37.c [2025-01-08 23:42:30,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dae70df/291548f8ea594274a96da1c79365b18f/FLAG81b0ea016 [2025-01-08 23:42:30,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0dae70df/291548f8ea594274a96da1c79365b18f [2025-01-08 23:42:30,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:42:30,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:42:30,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:30,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:42:30,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:42:30,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:30" (1/1) ... [2025-01-08 23:42:30,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7964faa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:30, skipping insertion in model container [2025-01-08 23:42:30,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:30" (1/1) ... [2025-01-08 23:42:30,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:42:31,040 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/Problem11_label37.c[7136,7149] [2025-01-08 23:42:31,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:31,166 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:42:31,182 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/Problem11_label37.c[7136,7149] [2025-01-08 23:42:31,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:31,261 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:42:31,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31 WrapperNode [2025-01-08 23:42:31,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:31,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:31,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:42:31,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:42:31,268 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:42:31" (1/1) ... [2025-01-08 23:42:31,291 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:42:31" (1/1) ... [2025-01-08 23:42:31,369 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:42:31,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:31,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:42:31,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:42:31,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:42:31,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,466 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:42:31,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:42:31,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:42:31,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:42:31,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:42:31,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (1/1) ... [2025-01-08 23:42:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:31,572 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:42:31,578 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:42:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:42:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:42:31,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:42:31,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:42:31,641 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:42:31,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:42:32,743 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:42:32,743 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:42:32,752 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:42:32,753 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:42:32,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:32 BoogieIcfgContainer [2025-01-08 23:42:32,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:42:32,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:42:32,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:42:32,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:42:32,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:42:30" (1/3) ... [2025-01-08 23:42:32,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5afa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:32, skipping insertion in model container [2025-01-08 23:42:32,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:31" (2/3) ... [2025-01-08 23:42:32,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5afa35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:32, skipping insertion in model container [2025-01-08 23:42:32,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:32" (3/3) ... [2025-01-08 23:42:32,759 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label37.c [2025-01-08 23:42:32,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:42:32,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label37.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:42:32,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:42:32,816 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;@67f9a239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:42:32,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:42:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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:42:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 23:42:32,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:32,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:32,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:32,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2007430668, now seen corresponding path program 1 times [2025-01-08 23:42:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398476027] [2025-01-08 23:42:32,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:32,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-08 23:42:32,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 23:42:32,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:32,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:33,089 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:42:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398476027] [2025-01-08 23:42:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398476027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681619992] [2025-01-08 23:42:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:33,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:33,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:33,115 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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:42:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:33,956 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-01-08 23:42:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:33,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2025-01-08 23:42:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:33,965 INFO L225 Difference]: With dead ends: 776 [2025-01-08 23:42:33,966 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:42:33,969 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:42:33,971 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 178 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:33,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 197 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:42:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-01-08 23:42:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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:42:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-01-08 23:42:34,009 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 49 [2025-01-08 23:42:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:34,010 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-01-08 23:42:34,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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:42:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-01-08 23:42:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 23:42:34,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:34,013 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, 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] [2025-01-08 23:42:34,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:42:34,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:34,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2055802181, now seen corresponding path program 1 times [2025-01-08 23:42:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279164646] [2025-01-08 23:42:34,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:34,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 23:42:34,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 23:42:34,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:34,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279164646] [2025-01-08 23:42:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279164646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203030283] [2025-01-08 23:42:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:34,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:34,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:34,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:34,187 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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:42:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:34,802 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-01-08 23:42:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2025-01-08 23:42:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:34,806 INFO L225 Difference]: With dead ends: 1209 [2025-01-08 23:42:34,806 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:42:34,807 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:42:34,808 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:34,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:42:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-01-08 23:42:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 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:42:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2025-01-08 23:42:34,829 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 117 [2025-01-08 23:42:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:34,829 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2025-01-08 23:42:34,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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:42:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2025-01-08 23:42:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 23:42:34,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:34,832 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, 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] [2025-01-08 23:42:34,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:42:34,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:34,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:34,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1715192480, now seen corresponding path program 1 times [2025-01-08 23:42:34,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122024978] [2025-01-08 23:42:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:34,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 23:42:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 23:42:34,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:34,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:35,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:35,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122024978] [2025-01-08 23:42:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122024978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234775669] [2025-01-08 23:42:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:35,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:35,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:35,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:35,032 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:42:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:35,557 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2025-01-08 23:42:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-01-08 23:42:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:35,561 INFO L225 Difference]: With dead ends: 1941 [2025-01-08 23:42:35,561 INFO L226 Difference]: Without dead ends: 1156 [2025-01-08 23:42:35,562 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:42:35,563 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:35,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-08 23:42:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-08 23:42:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 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:42:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2025-01-08 23:42:35,585 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 119 [2025-01-08 23:42:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2025-01-08 23:42:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:42:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2025-01-08 23:42:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 23:42:35,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:35,589 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, 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] [2025-01-08 23:42:35,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:42:35,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 674594743, now seen corresponding path program 1 times [2025-01-08 23:42:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867305916] [2025-01-08 23:42:35,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:35,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 23:42:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 23:42:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 23:42:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867305916] [2025-01-08 23:42:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867305916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989878465] [2025-01-08 23:42:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:35,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:35,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:35,810 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:42:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:36,502 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2025-01-08 23:42:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 161 [2025-01-08 23:42:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:36,508 INFO L225 Difference]: With dead ends: 3056 [2025-01-08 23:42:36,509 INFO L226 Difference]: Without dead ends: 1902 [2025-01-08 23:42:36,510 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:42:36,511 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:36,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-01-08 23:42:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2025-01-08 23:42:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.22) internal successors, (2318), 1900 states have internal predecessors, (2318), 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:42:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2025-01-08 23:42:36,540 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 161 [2025-01-08 23:42:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:36,541 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2025-01-08 23:42:36,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:42:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2025-01-08 23:42:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 23:42:36,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:36,544 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, 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] [2025-01-08 23:42:36,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:42:36,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 640186597, now seen corresponding path program 1 times [2025-01-08 23:42:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352530253] [2025-01-08 23:42:36,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:36,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 23:42:36,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 23:42:36,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:36,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352530253] [2025-01-08 23:42:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352530253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819461739] [2025-01-08 23:42:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:36,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:36,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:36,812 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:42:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:37,980 INFO L93 Difference]: Finished difference Result 4382 states and 5509 transitions. [2025-01-08 23:42:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 176 [2025-01-08 23:42:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:37,987 INFO L225 Difference]: With dead ends: 4382 [2025-01-08 23:42:37,987 INFO L226 Difference]: Without dead ends: 2667 [2025-01-08 23:42:37,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:37,990 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:37,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:42:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-01-08 23:42:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2664. [2025-01-08 23:42:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 1.2350732256853174) internal successors, (3289), 2663 states have internal predecessors, (3289), 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:42:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3289 transitions. [2025-01-08 23:42:38,027 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3289 transitions. Word has length 176 [2025-01-08 23:42:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:38,027 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 3289 transitions. [2025-01-08 23:42:38,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:42:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3289 transitions. [2025-01-08 23:42:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-08 23:42:38,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:38,030 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:42:38,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:38,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 131497187, now seen corresponding path program 1 times [2025-01-08 23:42:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374830428] [2025-01-08 23:42:38,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:38,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-08 23:42:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-08 23:42:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:42:38,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:38,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374830428] [2025-01-08 23:42:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374830428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:38,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453607481] [2025-01-08 23:42:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:38,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:38,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:38,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:38,220 INFO L87 Difference]: Start difference. First operand 2664 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:42:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:39,281 INFO L93 Difference]: Finished difference Result 6261 states and 7859 transitions. [2025-01-08 23:42:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:39,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:42:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:39,292 INFO L225 Difference]: With dead ends: 6261 [2025-01-08 23:42:39,292 INFO L226 Difference]: Without dead ends: 3783 [2025-01-08 23:42:39,294 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:42:39,296 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 148 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:39,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 391 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2025-01-08 23:42:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3585. [2025-01-08 23:42:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 3584 states have (on average 1.2131696428571428) internal successors, (4348), 3584 states have internal predecessors, (4348), 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:42:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4348 transitions. [2025-01-08 23:42:39,369 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4348 transitions. Word has length 231 [2025-01-08 23:42:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:39,370 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4348 transitions. [2025-01-08 23:42:39,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:42:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4348 transitions. [2025-01-08 23:42:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-08 23:42:39,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:39,372 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:39,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:42:39,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 432666258, now seen corresponding path program 1 times [2025-01-08 23:42:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127806340] [2025-01-08 23:42:39,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:39,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-08 23:42:39,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-08 23:42:39,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:39,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:42:39,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127806340] [2025-01-08 23:42:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127806340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:39,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282804529] [2025-01-08 23:42:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:39,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:39,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:39,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:39,519 INFO L87 Difference]: Start difference. First operand 3585 states and 4348 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:42:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:40,191 INFO L93 Difference]: Finished difference Result 8825 states and 10868 transitions. [2025-01-08 23:42:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 237 [2025-01-08 23:42:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:40,202 INFO L225 Difference]: With dead ends: 8825 [2025-01-08 23:42:40,202 INFO L226 Difference]: Without dead ends: 5242 [2025-01-08 23:42:40,205 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:42:40,205 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 162 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:40,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 147 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-01-08 23:42:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2025-01-08 23:42:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 5241 states have (on average 1.2144628887616866) internal successors, (6365), 5241 states have internal predecessors, (6365), 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:42:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6365 transitions. [2025-01-08 23:42:40,255 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6365 transitions. Word has length 237 [2025-01-08 23:42:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 5242 states and 6365 transitions. [2025-01-08 23:42:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:42:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6365 transitions. [2025-01-08 23:42:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-08 23:42:40,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:40,258 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:42:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:42:40,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -151291222, now seen corresponding path program 1 times [2025-01-08 23:42:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156179108] [2025-01-08 23:42:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:40,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-08 23:42:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-08 23:42:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:42:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156179108] [2025-01-08 23:42:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156179108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921774609] [2025-01-08 23:42:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:40,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:40,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:40,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:40,442 INFO L87 Difference]: Start difference. First operand 5242 states and 6365 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:42:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:41,494 INFO L93 Difference]: Finished difference Result 11965 states and 14659 transitions. [2025-01-08 23:42:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:41,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 268 [2025-01-08 23:42:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:41,509 INFO L225 Difference]: With dead ends: 11965 [2025-01-08 23:42:41,509 INFO L226 Difference]: Without dead ends: 6725 [2025-01-08 23:42:41,514 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:42:41,514 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 147 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:41,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2025-01-08 23:42:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 6715. [2025-01-08 23:42:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6715 states, 6714 states have (on average 1.1976467083705689) internal successors, (8041), 6714 states have internal predecessors, (8041), 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:42:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 8041 transitions. [2025-01-08 23:42:41,589 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 8041 transitions. Word has length 268 [2025-01-08 23:42:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 6715 states and 8041 transitions. [2025-01-08 23:42:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:42:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 8041 transitions. [2025-01-08 23:42:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-08 23:42:41,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:41,623 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, 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, 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] [2025-01-08 23:42:41,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:42:41,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:41,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2008959956, now seen corresponding path program 1 times [2025-01-08 23:42:41,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:41,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309551634] [2025-01-08 23:42:41,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:41,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-08 23:42:41,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-08 23:42:41,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:41,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-01-08 23:42:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309551634] [2025-01-08 23:42:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309551634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886349031] [2025-01-08 23:42:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:41,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:41,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:41,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:41,844 INFO L87 Difference]: Start difference. First operand 6715 states and 8041 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:42:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:42,875 INFO L93 Difference]: Finished difference Result 15091 states and 18253 transitions. [2025-01-08 23:42:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 314 [2025-01-08 23:42:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:42,908 INFO L225 Difference]: With dead ends: 15091 [2025-01-08 23:42:42,908 INFO L226 Difference]: Without dead ends: 8378 [2025-01-08 23:42:42,924 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:42:42,928 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 187 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:42,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 61 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:42:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8378 states. [2025-01-08 23:42:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8378 to 8372. [2025-01-08 23:42:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8372 states, 8371 states have (on average 1.2079799307131764) internal successors, (10112), 8371 states have internal predecessors, (10112), 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:42:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8372 states to 8372 states and 10112 transitions. [2025-01-08 23:42:43,132 INFO L78 Accepts]: Start accepts. Automaton has 8372 states and 10112 transitions. Word has length 314 [2025-01-08 23:42:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:43,133 INFO L471 AbstractCegarLoop]: Abstraction has 8372 states and 10112 transitions. [2025-01-08 23:42:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:42:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8372 states and 10112 transitions. [2025-01-08 23:42:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-08 23:42:43,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:43,148 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:43,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:43,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1897606466, now seen corresponding path program 1 times [2025-01-08 23:42:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581980412] [2025-01-08 23:42:43,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:43,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-08 23:42:43,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-08 23:42:43,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:43,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:42:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581980412] [2025-01-08 23:42:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581980412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821366601] [2025-01-08 23:42:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:43,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:43,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:43,361 INFO L87 Difference]: Start difference. First operand 8372 states and 10112 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:42:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:44,012 INFO L93 Difference]: Finished difference Result 16159 states and 19512 transitions. [2025-01-08 23:42:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 349 [2025-01-08 23:42:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:44,023 INFO L225 Difference]: With dead ends: 16159 [2025-01-08 23:42:44,023 INFO L226 Difference]: Without dead ends: 7789 [2025-01-08 23:42:44,029 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:42:44,030 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:44,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 151 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2025-01-08 23:42:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 7419. [2025-01-08 23:42:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7419 states, 7418 states have (on average 1.14855756268536) internal successors, (8520), 7418 states have internal predecessors, (8520), 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:42:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 8520 transitions. [2025-01-08 23:42:44,096 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 8520 transitions. Word has length 349 [2025-01-08 23:42:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:44,096 INFO L471 AbstractCegarLoop]: Abstraction has 7419 states and 8520 transitions. [2025-01-08 23:42:44,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:42:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 8520 transitions. [2025-01-08 23:42:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-08 23:42:44,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:44,104 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:42:44,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:44,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1122300015, now seen corresponding path program 1 times [2025-01-08 23:42:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412081329] [2025-01-08 23:42:44,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:44,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:42:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:42:44,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:44,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412081329] [2025-01-08 23:42:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412081329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410167003] [2025-01-08 23:42:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:44,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:44,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:44,391 INFO L87 Difference]: Start difference. First operand 7419 states and 8520 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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:42:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:45,370 INFO L93 Difference]: Finished difference Result 17416 states and 20000 transitions. [2025-01-08 23:42:45,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:45,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 354 [2025-01-08 23:42:45,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:45,385 INFO L225 Difference]: With dead ends: 17416 [2025-01-08 23:42:45,386 INFO L226 Difference]: Without dead ends: 9999 [2025-01-08 23:42:45,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:45,393 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:45,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 63 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2025-01-08 23:42:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8334. [2025-01-08 23:42:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8334 states, 8333 states have (on average 1.1386055442217689) internal successors, (9488), 8333 states have internal predecessors, (9488), 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:42:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8334 states to 8334 states and 9488 transitions. [2025-01-08 23:42:45,504 INFO L78 Accepts]: Start accepts. Automaton has 8334 states and 9488 transitions. Word has length 354 [2025-01-08 23:42:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 8334 states and 9488 transitions. [2025-01-08 23:42:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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:42:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8334 states and 9488 transitions. [2025-01-08 23:42:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-08 23:42:45,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:45,516 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, 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, 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] [2025-01-08 23:42:45,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:45,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1981015259, now seen corresponding path program 1 times [2025-01-08 23:42:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120559724] [2025-01-08 23:42:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-08 23:42:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-08 23:42:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:42:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120559724] [2025-01-08 23:42:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120559724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239859343] [2025-01-08 23:42:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:45,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:45,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:45,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:45,859 INFO L87 Difference]: Start difference. First operand 8334 states and 9488 transitions. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:42:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:46,827 INFO L93 Difference]: Finished difference Result 17956 states and 20428 transitions. [2025-01-08 23:42:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:46,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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 428 [2025-01-08 23:42:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:46,841 INFO L225 Difference]: With dead ends: 17956 [2025-01-08 23:42:46,841 INFO L226 Difference]: Without dead ends: 9624 [2025-01-08 23:42:46,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:46,849 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 235 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:46,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 64 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9624 states. [2025-01-08 23:42:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9624 to 7966. [2025-01-08 23:42:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7966 states, 7965 states have (on average 1.1382297551789078) internal successors, (9066), 7965 states have internal predecessors, (9066), 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:42:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 9066 transitions. [2025-01-08 23:42:46,919 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 9066 transitions. Word has length 428 [2025-01-08 23:42:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:46,920 INFO L471 AbstractCegarLoop]: Abstraction has 7966 states and 9066 transitions. [2025-01-08 23:42:46,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:42:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 9066 transitions. [2025-01-08 23:42:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-01-08 23:42:46,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:46,932 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:42:46,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:46,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -892075785, now seen corresponding path program 1 times [2025-01-08 23:42:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133239141] [2025-01-08 23:42:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-08 23:42:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-08 23:42:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-01-08 23:42:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133239141] [2025-01-08 23:42:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133239141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:47,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:47,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527000627] [2025-01-08 23:42:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:47,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:47,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:47,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:47,125 INFO L87 Difference]: Start difference. First operand 7966 states and 9066 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:42:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:47,694 INFO L93 Difference]: Finished difference Result 17215 states and 19601 transitions. [2025-01-08 23:42:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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 547 [2025-01-08 23:42:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:47,695 INFO L225 Difference]: With dead ends: 17215 [2025-01-08 23:42:47,695 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:47,704 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:42:47,704 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:47,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 355 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:42:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:47,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 547 [2025-01-08 23:42:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:47,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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:42:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:47,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:47,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:42:47,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:47,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:42:48,155 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:42:48,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:42:48 BoogieIcfgContainer [2025-01-08 23:42:48,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:42:48,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:42:48,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:42:48,170 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:42:48,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:32" (3/4) ... [2025-01-08 23:42:48,171 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:42:48,187 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:42:48,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:42:48,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:42:48,191 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:42:48,311 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:42:48,311 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:42:48,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:42:48,312 INFO L158 Benchmark]: Toolchain (without parser) took 17445.62ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 103.7MB in the beginning and 529.0MB in the end (delta: -425.3MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,312 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:42:48,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.80ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 60.3MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.60ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 43.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,313 INFO L158 Benchmark]: Boogie Preprocessor took 178.29ms. Allocated memory is still 142.6MB. Free memory was 43.6MB in the beginning and 81.7MB in the end (delta: -38.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,313 INFO L158 Benchmark]: RCFGBuilder took 1203.91ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 81.7MB in the beginning and 288.3MB in the end (delta: -206.6MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,314 INFO L158 Benchmark]: TraceAbstraction took 15414.37ms. Allocated memory was 394.3MB in the beginning and 587.2MB in the end (delta: 192.9MB). Free memory was 287.4MB in the beginning and 197.5MB in the end (delta: 89.9MB). Peak memory consumption was 287.2MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,314 INFO L158 Benchmark]: Witness Printer took 141.85ms. Allocated memory is still 587.2MB. Free memory was 197.5MB in the beginning and 529.0MB in the end (delta: -331.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:42:48,315 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.80ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 60.3MB in the end (delta: 43.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.60ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 43.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.29ms. Allocated memory is still 142.6MB. Free memory was 43.6MB in the beginning and 81.7MB in the end (delta: -38.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.91ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 81.7MB in the beginning and 288.3MB in the end (delta: -206.6MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15414.37ms. Allocated memory was 394.3MB in the beginning and 587.2MB in the end (delta: 192.9MB). Free memory was 287.4MB in the beginning and 197.5MB in the end (delta: 89.9MB). Peak memory consumption was 287.2MB. Max. memory is 16.1GB. * Witness Printer took 141.85ms. Allocated memory is still 587.2MB. Free memory was 197.5MB in the beginning and 529.0MB in the end (delta: -331.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 163]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 2613 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 1522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8261 IncrementalHoareTripleChecker+Invalid, 9783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1522 mSolverCounterUnsat, 2313 mSDtfsCounter, 8261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8372occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 3926 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3350 NumberOfCodeBlocks, 3350 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3337 ConstructedInterpolants, 0 QuantifiedInterpolants, 6043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2926/2926 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((a29 <= 277) && (a4 == 0))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((a29 <= 277) && (a4 == 1))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599998))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:42:48,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE