./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:27:22,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:27:22,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:27:22,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:27:22,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:27:22,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:27:22,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:27:22,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:27:22,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:27:22,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:27:22,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:27:22,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:27:22,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:27:22,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:27:22,344 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:27:22,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:27:22,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:27:22,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:27:22,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:22,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:22,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:22,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:22,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:22,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:27:22,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:27:22,347 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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2025-01-09 04:27:22,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:27:22,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:27:22,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:27:22,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:27:22,620 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:27:22,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:23,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e586aca6/0ef7fca752244959b42f3634adda161d/FLAGb64ec7725 [2025-01-09 04:27:24,233 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:27:24,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:24,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e586aca6/0ef7fca752244959b42f3634adda161d/FLAGb64ec7725 [2025-01-09 04:27:24,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e586aca6/0ef7fca752244959b42f3634adda161d [2025-01-09 04:27:24,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:27:24,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:27:24,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:24,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:27:24,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:27:24,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab61f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24, skipping insertion in model container [2025-01-09 04:27:24,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:27:24,721 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/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2025-01-09 04:27:24,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:24,737 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:27:24,794 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/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2025-01-09 04:27:24,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:24,813 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:27:24,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24 WrapperNode [2025-01-09 04:27:24,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:24,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:24,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:27:24,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:27:24,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,863 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 493 [2025-01-09 04:27:24,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:24,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:27:24,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:27:24,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:27:24,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:27:24,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:27:24,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:27:24,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:27:24,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:27:24,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (1/1) ... [2025-01-09 04:27:24,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:27:24,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:27:24,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:27:24,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:27:24,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:27:24,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:27:24,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:27:25,039 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:27:25,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:27:25,542 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 04:27:25,542 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:27:25,554 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:27:25,555 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:27:25,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:25 BoogieIcfgContainer [2025-01-09 04:27:25,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:27:25,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:27:25,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:27:25,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:27:25,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:24" (1/3) ... [2025-01-09 04:27:25,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43353e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:25, skipping insertion in model container [2025-01-09 04:27:25,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:24" (2/3) ... [2025-01-09 04:27:25,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43353e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:25, skipping insertion in model container [2025-01-09 04:27:25,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:25" (3/3) ... [2025-01-09 04:27:25,564 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:27:25,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:27:25,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:27:25,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:27:25,625 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;@3cb25168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:27:25,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:27:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:27:25,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:25,634 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] [2025-01-09 04:27:25,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1611602704, now seen corresponding path program 1 times [2025-01-09 04:27:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453054924] [2025-01-09 04:27:25,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:25,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:27:25,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:27:25,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:25,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:25,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453054924] [2025-01-09 04:27:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453054924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:25,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:25,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:27:25,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514416969] [2025-01-09 04:27:25,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:27:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:25,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:27:25,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:25,954 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:25,975 INFO L93 Difference]: Finished difference Result 210 states and 364 transitions. [2025-01-09 04:27:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:27:25,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2025-01-09 04:27:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:25,991 INFO L225 Difference]: With dead ends: 210 [2025-01-09 04:27:25,992 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 04:27:25,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:26,004 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:26,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 04:27:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 04:27:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions. [2025-01-09 04:27:26,042 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37 [2025-01-09 04:27:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:26,042 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 232 transitions. [2025-01-09 04:27:26,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2025-01-09 04:27:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:27:26,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:26,043 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] [2025-01-09 04:27:26,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:27:26,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:26,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1865716142, now seen corresponding path program 1 times [2025-01-09 04:27:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:26,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436734776] [2025-01-09 04:27:26,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:26,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:26,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:27:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:27:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436734776] [2025-01-09 04:27:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436734776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080364056] [2025-01-09 04:27:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:26,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:26,341 INFO L87 Difference]: Start difference. First operand 133 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:26,430 INFO L93 Difference]: Finished difference Result 210 states and 360 transitions. [2025-01-09 04:27:26,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:26,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-01-09 04:27:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:26,432 INFO L225 Difference]: With dead ends: 210 [2025-01-09 04:27:26,432 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 04:27:26,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:26,433 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:26,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 04:27:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-09 04:27:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-01-09 04:27:26,438 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2025-01-09 04:27:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:26,438 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-01-09 04:27:26,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-01-09 04:27:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:27:26,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:26,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:26,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:27:26,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:26,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash -608316044, now seen corresponding path program 1 times [2025-01-09 04:27:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:26,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346894166] [2025-01-09 04:27:26,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:26,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:27:26,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:27:26,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:26,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346894166] [2025-01-09 04:27:26,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346894166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:26,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794336347] [2025-01-09 04:27:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:26,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:26,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:26,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:26,595 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:26,642 INFO L93 Difference]: Finished difference Result 265 states and 424 transitions. [2025-01-09 04:27:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2025-01-09 04:27:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:26,645 INFO L225 Difference]: With dead ends: 265 [2025-01-09 04:27:26,647 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 04:27:26,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:26,648 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:26,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 04:27:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-01-09 04:27:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.553191489361702) internal successors, (292), 188 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 292 transitions. [2025-01-09 04:27:26,663 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 292 transitions. Word has length 66 [2025-01-09 04:27:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:26,664 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 292 transitions. [2025-01-09 04:27:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 292 transitions. [2025-01-09 04:27:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:27:26,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:26,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:26,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:27:26,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:26,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1817309826, now seen corresponding path program 1 times [2025-01-09 04:27:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920847041] [2025-01-09 04:27:26,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:26,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:27:26,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:27:26,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:26,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:26,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920847041] [2025-01-09 04:27:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920847041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431366380] [2025-01-09 04:27:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:26,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:26,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:26,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:26,798 INFO L87 Difference]: Start difference. First operand 189 states and 292 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:26,832 INFO L93 Difference]: Finished difference Result 431 states and 692 transitions. [2025-01-09 04:27:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2025-01-09 04:27:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:26,834 INFO L225 Difference]: With dead ends: 431 [2025-01-09 04:27:26,836 INFO L226 Difference]: Without dead ends: 302 [2025-01-09 04:27:26,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:26,838 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:26,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-09 04:27:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2025-01-09 04:27:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.5858585858585859) internal successors, (471), 297 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 471 transitions. [2025-01-09 04:27:26,860 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 471 transitions. Word has length 68 [2025-01-09 04:27:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:26,861 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 471 transitions. [2025-01-09 04:27:26,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 471 transitions. [2025-01-09 04:27:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:27:26,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:26,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:27:26,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:26,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash -664285040, now seen corresponding path program 1 times [2025-01-09 04:27:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:26,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699142405] [2025-01-09 04:27:26,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:26,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:27:26,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:27:26,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:26,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699142405] [2025-01-09 04:27:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699142405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342770681] [2025-01-09 04:27:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:26,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:26,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:26,989 INFO L87 Difference]: Start difference. First operand 298 states and 471 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:27,039 INFO L93 Difference]: Finished difference Result 742 states and 1201 transitions. [2025-01-09 04:27:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-01-09 04:27:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:27,043 INFO L225 Difference]: With dead ends: 742 [2025-01-09 04:27:27,044 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 04:27:27,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:27,047 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:27,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 04:27:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-01-09 04:27:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.5995975855130784) internal successors, (795), 497 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 795 transitions. [2025-01-09 04:27:27,100 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 795 transitions. Word has length 70 [2025-01-09 04:27:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:27,100 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 795 transitions. [2025-01-09 04:27:27,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 795 transitions. [2025-01-09 04:27:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:27:27,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:27,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:27:27,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash -437424226, now seen corresponding path program 1 times [2025-01-09 04:27:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-01-09 04:27:27,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:27,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:27:27,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:27:27,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:27,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:27,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-01-09 04:27:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210927888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:27,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058753337] [2025-01-09 04:27:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:27,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:27,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:27,283 INFO L87 Difference]: Start difference. First operand 498 states and 795 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:27,444 INFO L93 Difference]: Finished difference Result 2494 states and 4085 transitions. [2025-01-09 04:27:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:27:27,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2025-01-09 04:27:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:27,456 INFO L225 Difference]: With dead ends: 2494 [2025-01-09 04:27:27,456 INFO L226 Difference]: Without dead ends: 2056 [2025-01-09 04:27:27,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:27,459 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 816 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:27,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1144 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2025-01-09 04:27:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 918. [2025-01-09 04:27:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 1.612868047982552) internal successors, (1479), 917 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1479 transitions. [2025-01-09 04:27:27,514 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1479 transitions. Word has length 72 [2025-01-09 04:27:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1479 transitions. [2025-01-09 04:27:27,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1479 transitions. [2025-01-09 04:27:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:27:27,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:27,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:27,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:27:27,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1696885564, now seen corresponding path program 1 times [2025-01-09 04:27:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440057090] [2025-01-09 04:27:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:27:27,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:27:27,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:27,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440057090] [2025-01-09 04:27:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440057090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776509762] [2025-01-09 04:27:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:27,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:27,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:27,623 INFO L87 Difference]: Start difference. First operand 918 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:27,709 INFO L93 Difference]: Finished difference Result 3318 states and 5402 transitions. [2025-01-09 04:27:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:27,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 73 [2025-01-09 04:27:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:27,718 INFO L225 Difference]: With dead ends: 3318 [2025-01-09 04:27:27,718 INFO L226 Difference]: Without dead ends: 2460 [2025-01-09 04:27:27,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:27,720 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 357 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:27,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 653 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2025-01-09 04:27:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1680. [2025-01-09 04:27:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1679 states have (on average 1.614651578320429) internal successors, (2711), 1679 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2711 transitions. [2025-01-09 04:27:27,796 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2711 transitions. Word has length 73 [2025-01-09 04:27:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:27,796 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2711 transitions. [2025-01-09 04:27:27,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2711 transitions. [2025-01-09 04:27:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:27:27,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:27,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:27,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:27:27,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:27,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:27,799 INFO L85 PathProgramCache]: Analyzing trace with hash -689983339, now seen corresponding path program 1 times [2025-01-09 04:27:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:27,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952072548] [2025-01-09 04:27:27,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:27,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:27:27,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:27:27,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:27,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:27,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952072548] [2025-01-09 04:27:27,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952072548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:27,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:27,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707925826] [2025-01-09 04:27:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:27,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:27,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:27,887 INFO L87 Difference]: Start difference. First operand 1680 states and 2711 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:28,040 INFO L93 Difference]: Finished difference Result 4944 states and 8046 transitions. [2025-01-09 04:27:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:27:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:28,065 INFO L225 Difference]: With dead ends: 4944 [2025-01-09 04:27:28,065 INFO L226 Difference]: Without dead ends: 3324 [2025-01-09 04:27:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:28,073 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:28,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2025-01-09 04:27:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 2486. [2025-01-09 04:27:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2485 states have (on average 1.6116700201207244) internal successors, (4005), 2485 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4005 transitions. [2025-01-09 04:27:28,209 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4005 transitions. Word has length 74 [2025-01-09 04:27:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:28,209 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4005 transitions. [2025-01-09 04:27:28,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4005 transitions. [2025-01-09 04:27:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:27:28,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:28,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:28,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:27:28,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1499470957, now seen corresponding path program 1 times [2025-01-09 04:27:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457655515] [2025-01-09 04:27:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:28,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:27:28,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:27:28,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457655515] [2025-01-09 04:27:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457655515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:28,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:28,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948221919] [2025-01-09 04:27:28,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:28,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:28,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:28,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:28,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:28,310 INFO L87 Difference]: Start difference. First operand 2486 states and 4005 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:28,444 INFO L93 Difference]: Finished difference Result 7296 states and 11834 transitions. [2025-01-09 04:27:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:28,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 75 [2025-01-09 04:27:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:28,458 INFO L225 Difference]: With dead ends: 7296 [2025-01-09 04:27:28,458 INFO L226 Difference]: Without dead ends: 4870 [2025-01-09 04:27:28,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:28,461 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:28,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 661 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2025-01-09 04:27:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3656. [2025-01-09 04:27:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3655 states have (on average 1.6073871409028728) internal successors, (5875), 3655 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5875 transitions. [2025-01-09 04:27:28,547 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5875 transitions. Word has length 75 [2025-01-09 04:27:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:28,547 INFO L471 AbstractCegarLoop]: Abstraction has 3656 states and 5875 transitions. [2025-01-09 04:27:28,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5875 transitions. [2025-01-09 04:27:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:27:28,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:28,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:28,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:27:28,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:28,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1585023799, now seen corresponding path program 1 times [2025-01-09 04:27:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326468162] [2025-01-09 04:27:28,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:28,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:27:28,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:27:28,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326468162] [2025-01-09 04:27:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326468162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326647287] [2025-01-09 04:27:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:28,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:28,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:28,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:28,609 INFO L87 Difference]: Start difference. First operand 3656 states and 5875 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:28,676 INFO L93 Difference]: Finished difference Result 8284 states and 13306 transitions. [2025-01-09 04:27:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-01-09 04:27:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:28,693 INFO L225 Difference]: With dead ends: 8284 [2025-01-09 04:27:28,693 INFO L226 Difference]: Without dead ends: 5684 [2025-01-09 04:27:28,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:28,697 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:28,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 413 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2025-01-09 04:27:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5682. [2025-01-09 04:27:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5682 states, 5681 states have (on average 1.588804787889456) internal successors, (9026), 5681 states have internal predecessors, (9026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 5682 states and 9026 transitions. [2025-01-09 04:27:28,809 INFO L78 Accepts]: Start accepts. Automaton has 5682 states and 9026 transitions. Word has length 76 [2025-01-09 04:27:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:28,810 INFO L471 AbstractCegarLoop]: Abstraction has 5682 states and 9026 transitions. [2025-01-09 04:27:28,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5682 states and 9026 transitions. [2025-01-09 04:27:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:27:28,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:28,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:27:28,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -497278857, now seen corresponding path program 1 times [2025-01-09 04:27:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074084351] [2025-01-09 04:27:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:27:28,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:27:28,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074084351] [2025-01-09 04:27:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074084351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981757149] [2025-01-09 04:27:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:28,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:28,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:28,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:28,866 INFO L87 Difference]: Start difference. First operand 5682 states and 9026 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:28,978 INFO L93 Difference]: Finished difference Result 12456 states and 19800 transitions. [2025-01-09 04:27:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-01-09 04:27:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:29,018 INFO L225 Difference]: With dead ends: 12456 [2025-01-09 04:27:29,018 INFO L226 Difference]: Without dead ends: 8428 [2025-01-09 04:27:29,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:29,028 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:29,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 441 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8428 states. [2025-01-09 04:27:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8428 to 8426. [2025-01-09 04:27:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8426 states, 8425 states have (on average 1.5717507418397627) internal successors, (13242), 8425 states have internal predecessors, (13242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8426 states to 8426 states and 13242 transitions. [2025-01-09 04:27:29,351 INFO L78 Accepts]: Start accepts. Automaton has 8426 states and 13242 transitions. Word has length 76 [2025-01-09 04:27:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:29,351 INFO L471 AbstractCegarLoop]: Abstraction has 8426 states and 13242 transitions. [2025-01-09 04:27:29,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8426 states and 13242 transitions. [2025-01-09 04:27:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:27:29,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:29,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:29,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:27:29,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:29,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:29,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1362508361, now seen corresponding path program 1 times [2025-01-09 04:27:29,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:29,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333612167] [2025-01-09 04:27:29,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:29,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:29,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:27:29,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:27:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333612167] [2025-01-09 04:27:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333612167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899896702] [2025-01-09 04:27:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:29,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:29,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:29,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:29,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:29,404 INFO L87 Difference]: Start difference. First operand 8426 states and 13242 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:29,520 INFO L93 Difference]: Finished difference Result 20215 states and 31930 transitions. [2025-01-09 04:27:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:29,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2025-01-09 04:27:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:29,543 INFO L225 Difference]: With dead ends: 20215 [2025-01-09 04:27:29,543 INFO L226 Difference]: Without dead ends: 11867 [2025-01-09 04:27:29,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:29,555 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:29,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2025-01-09 04:27:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 11865. [2025-01-09 04:27:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11865 states, 11864 states have (on average 1.5761968981793661) internal successors, (18700), 11864 states have internal predecessors, (18700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11865 states to 11865 states and 18700 transitions. [2025-01-09 04:27:29,847 INFO L78 Accepts]: Start accepts. Automaton has 11865 states and 18700 transitions. Word has length 76 [2025-01-09 04:27:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:29,847 INFO L471 AbstractCegarLoop]: Abstraction has 11865 states and 18700 transitions. [2025-01-09 04:27:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11865 states and 18700 transitions. [2025-01-09 04:27:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:29,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:29,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:27:29,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash -10098773, now seen corresponding path program 1 times [2025-01-09 04:27:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130436729] [2025-01-09 04:27:29,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:29,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:29,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:29,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:29,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130436729] [2025-01-09 04:27:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130436729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:30,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:30,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182212421] [2025-01-09 04:27:30,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:30,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:30,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:30,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:30,035 INFO L87 Difference]: Start difference. First operand 11865 states and 18700 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:30,238 INFO L93 Difference]: Finished difference Result 23654 states and 37297 transitions. [2025-01-09 04:27:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-01-09 04:27:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:30,262 INFO L225 Difference]: With dead ends: 23654 [2025-01-09 04:27:30,263 INFO L226 Difference]: Without dead ends: 11867 [2025-01-09 04:27:30,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:27:30,278 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 189 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:30,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 538 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2025-01-09 04:27:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 11865. [2025-01-09 04:27:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11865 states, 11864 states have (on average 1.563553607552259) internal successors, (18550), 11864 states have internal predecessors, (18550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11865 states to 11865 states and 18550 transitions. [2025-01-09 04:27:30,593 INFO L78 Accepts]: Start accepts. Automaton has 11865 states and 18550 transitions. Word has length 77 [2025-01-09 04:27:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 11865 states and 18550 transitions. [2025-01-09 04:27:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11865 states and 18550 transitions. [2025-01-09 04:27:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:27:30,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:30,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:30,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:27:30,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1498136792, now seen corresponding path program 1 times [2025-01-09 04:27:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033159640] [2025-01-09 04:27:30,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:30,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:27:30,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:27:30,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033159640] [2025-01-09 04:27:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033159640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776223277] [2025-01-09 04:27:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:30,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:30,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:30,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:30,773 INFO L87 Difference]: Start difference. First operand 11865 states and 18550 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:31,082 INFO L93 Difference]: Finished difference Result 34237 states and 53673 transitions. [2025-01-09 04:27:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:31,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:27:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:31,125 INFO L225 Difference]: With dead ends: 34237 [2025-01-09 04:27:31,125 INFO L226 Difference]: Without dead ends: 22450 [2025-01-09 04:27:31,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:27:31,146 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 185 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:31,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 540 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22450 states. [2025-01-09 04:27:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22450 to 22448. [2025-01-09 04:27:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22448 states, 22447 states have (on average 1.5508531206842786) internal successors, (34812), 22447 states have internal predecessors, (34812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 34812 transitions. [2025-01-09 04:27:31,569 INFO L78 Accepts]: Start accepts. Automaton has 22448 states and 34812 transitions. Word has length 80 [2025-01-09 04:27:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:31,569 INFO L471 AbstractCegarLoop]: Abstraction has 22448 states and 34812 transitions. [2025-01-09 04:27:31,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22448 states and 34812 transitions. [2025-01-09 04:27:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:27:31,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:31,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:27:31,570 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1230975340, now seen corresponding path program 1 times [2025-01-09 04:27:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851755516] [2025-01-09 04:27:31,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:31,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:27:31,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:27:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851755516] [2025-01-09 04:27:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851755516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:27:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043448576] [2025-01-09 04:27:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:31,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:27:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:31,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:27:31,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:31,863 INFO L87 Difference]: Start difference. First operand 22448 states and 34812 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:32,094 INFO L93 Difference]: Finished difference Result 23611 states and 36361 transitions. [2025-01-09 04:27:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:27:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 04:27:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:32,138 INFO L225 Difference]: With dead ends: 23611 [2025-01-09 04:27:32,138 INFO L226 Difference]: Without dead ends: 23609 [2025-01-09 04:27:32,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:32,145 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:32,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23609 states. [2025-01-09 04:27:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23609 to 23609. [2025-01-09 04:27:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23609 states, 23608 states have (on average 1.5233819044391732) internal successors, (35964), 23608 states have internal predecessors, (35964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23609 states to 23609 states and 35964 transitions. [2025-01-09 04:27:32,463 INFO L78 Accepts]: Start accepts. Automaton has 23609 states and 35964 transitions. Word has length 81 [2025-01-09 04:27:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:32,463 INFO L471 AbstractCegarLoop]: Abstraction has 23609 states and 35964 transitions. [2025-01-09 04:27:32,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23609 states and 35964 transitions. [2025-01-09 04:27:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:32,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:32,466 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:32,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:27:32,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:32,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash 65087773, now seen corresponding path program 1 times [2025-01-09 04:27:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083764783] [2025-01-09 04:27:32,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:32,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:32,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:32,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:32,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:27:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083764783] [2025-01-09 04:27:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083764783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417930444] [2025-01-09 04:27:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:32,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:32,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:32,599 INFO L87 Difference]: Start difference. First operand 23609 states and 35964 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:33,013 INFO L93 Difference]: Finished difference Result 59107 states and 90255 transitions. [2025-01-09 04:27:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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 109 [2025-01-09 04:27:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:33,109 INFO L225 Difference]: With dead ends: 59107 [2025-01-09 04:27:33,110 INFO L226 Difference]: Without dead ends: 48161 [2025-01-09 04:27:33,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:33,136 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 449 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:33,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 901 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48161 states. [2025-01-09 04:27:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48161 to 37091. [2025-01-09 04:27:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37091 states, 37090 states have (on average 1.5195740091668914) internal successors, (56361), 37090 states have internal predecessors, (56361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37091 states to 37091 states and 56361 transitions. [2025-01-09 04:27:33,886 INFO L78 Accepts]: Start accepts. Automaton has 37091 states and 56361 transitions. Word has length 109 [2025-01-09 04:27:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:33,887 INFO L471 AbstractCegarLoop]: Abstraction has 37091 states and 56361 transitions. [2025-01-09 04:27:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37091 states and 56361 transitions. [2025-01-09 04:27:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:33,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:33,889 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:33,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:27:33,889 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:33,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2017214883, now seen corresponding path program 1 times [2025-01-09 04:27:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631096680] [2025-01-09 04:27:33,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:33,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:27:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631096680] [2025-01-09 04:27:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631096680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569457188] [2025-01-09 04:27:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:34,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:34,030 INFO L87 Difference]: Start difference. First operand 37091 states and 56361 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:34,593 INFO L93 Difference]: Finished difference Result 63523 states and 97023 transitions. [2025-01-09 04:27:34,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 109 [2025-01-09 04:27:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:34,701 INFO L225 Difference]: With dead ends: 63523 [2025-01-09 04:27:34,701 INFO L226 Difference]: Without dead ends: 52577 [2025-01-09 04:27:34,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:34,732 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 450 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:34,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 878 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52577 states. [2025-01-09 04:27:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52577 to 50355. [2025-01-09 04:27:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50355 states, 50354 states have (on average 1.5203360209715215) internal successors, (76555), 50354 states have internal predecessors, (76555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50355 states to 50355 states and 76555 transitions. [2025-01-09 04:27:35,709 INFO L78 Accepts]: Start accepts. Automaton has 50355 states and 76555 transitions. Word has length 109 [2025-01-09 04:27:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:35,711 INFO L471 AbstractCegarLoop]: Abstraction has 50355 states and 76555 transitions. [2025-01-09 04:27:35,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 50355 states and 76555 transitions. [2025-01-09 04:27:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:35,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:35,713 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:35,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:27:35,713 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1412522909, now seen corresponding path program 1 times [2025-01-09 04:27:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-01-09 04:27:35,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:35,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-01-09 04:27:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937677039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946236194] [2025-01-09 04:27:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:35,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:35,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:35,809 INFO L87 Difference]: Start difference. First operand 50355 states and 76555 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:36,488 INFO L93 Difference]: Finished difference Result 74957 states and 114494 transitions. [2025-01-09 04:27:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:36,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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 109 [2025-01-09 04:27:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:36,639 INFO L225 Difference]: With dead ends: 74957 [2025-01-09 04:27:36,639 INFO L226 Difference]: Without dead ends: 61345 [2025-01-09 04:27:36,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:36,653 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 444 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:36,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 919 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61345 states. [2025-01-09 04:27:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61345 to 59123. [2025-01-09 04:27:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59123 states, 59122 states have (on average 1.5219546023476878) internal successors, (89981), 59122 states have internal predecessors, (89981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59123 states to 59123 states and 89981 transitions. [2025-01-09 04:27:37,976 INFO L78 Accepts]: Start accepts. Automaton has 59123 states and 89981 transitions. Word has length 109 [2025-01-09 04:27:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 59123 states and 89981 transitions. [2025-01-09 04:27:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 59123 states and 89981 transitions. [2025-01-09 04:27:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:27:37,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:37,978 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:37,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:27:37,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1084295395, now seen corresponding path program 1 times [2025-01-09 04:27:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:37,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582408739] [2025-01-09 04:27:37,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:37,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:27:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:27:37,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582408739] [2025-01-09 04:27:38,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582408739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:38,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:38,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:38,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497069624] [2025-01-09 04:27:38,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:38,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:38,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:38,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:38,066 INFO L87 Difference]: Start difference. First operand 59123 states and 89981 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:38,840 INFO L93 Difference]: Finished difference Result 101592 states and 155179 transitions. [2025-01-09 04:27:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 110 [2025-01-09 04:27:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:39,004 INFO L225 Difference]: With dead ends: 101592 [2025-01-09 04:27:39,005 INFO L226 Difference]: Without dead ends: 79212 [2025-01-09 04:27:39,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:39,027 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 192 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:39,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 611 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79212 states. [2025-01-09 04:27:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79212 to 76992. [2025-01-09 04:27:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76992 states, 76991 states have (on average 1.519671130391864) internal successors, (117001), 76991 states have internal predecessors, (117001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76992 states to 76992 states and 117001 transitions. [2025-01-09 04:27:40,537 INFO L78 Accepts]: Start accepts. Automaton has 76992 states and 117001 transitions. Word has length 110 [2025-01-09 04:27:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:40,537 INFO L471 AbstractCegarLoop]: Abstraction has 76992 states and 117001 transitions. [2025-01-09 04:27:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 76992 states and 117001 transitions. [2025-01-09 04:27:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:27:40,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:40,540 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:40,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:27:40,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:40,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -661593569, now seen corresponding path program 1 times [2025-01-09 04:27:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866107278] [2025-01-09 04:27:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:40,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:27:40,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:27:40,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:40,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:40,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866107278] [2025-01-09 04:27:40,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866107278] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:40,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282441987] [2025-01-09 04:27:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:40,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:40,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:40,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:40,597 INFO L87 Difference]: Start difference. First operand 76992 states and 117001 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:41,715 INFO L93 Difference]: Finished difference Result 176286 states and 268200 transitions. [2025-01-09 04:27:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 110 [2025-01-09 04:27:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:41,920 INFO L225 Difference]: With dead ends: 176286 [2025-01-09 04:27:41,920 INFO L226 Difference]: Without dead ends: 135992 [2025-01-09 04:27:41,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:41,979 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:41,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 368 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135992 states. [2025-01-09 04:27:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135992 to 135714. [2025-01-09 04:27:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135714 states, 135713 states have (on average 1.516988055676317) internal successors, (205875), 135713 states have internal predecessors, (205875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135714 states to 135714 states and 205875 transitions. [2025-01-09 04:27:44,797 INFO L78 Accepts]: Start accepts. Automaton has 135714 states and 205875 transitions. Word has length 110 [2025-01-09 04:27:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:44,800 INFO L471 AbstractCegarLoop]: Abstraction has 135714 states and 205875 transitions. [2025-01-09 04:27:44,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 135714 states and 205875 transitions. [2025-01-09 04:27:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:27:44,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:44,805 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:27:44,811 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1549618068, now seen corresponding path program 1 times [2025-01-09 04:27:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353579574] [2025-01-09 04:27:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:44,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:27:44,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:27:44,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:44,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:27:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:44,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353579574] [2025-01-09 04:27:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353579574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580059181] [2025-01-09 04:27:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:44,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:44,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:44,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:44,926 INFO L87 Difference]: Start difference. First operand 135714 states and 205875 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:46,590 INFO L93 Difference]: Finished difference Result 206334 states and 314440 transitions. [2025-01-09 04:27:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 111 [2025-01-09 04:27:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:46,835 INFO L225 Difference]: With dead ends: 206334 [2025-01-09 04:27:46,835 INFO L226 Difference]: Without dead ends: 167968 [2025-01-09 04:27:46,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:46,876 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 196 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:46,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 610 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167968 states. [2025-01-09 04:27:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167968 to 159116. [2025-01-09 04:27:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159116 states, 159115 states have (on average 1.5164566508500141) internal successors, (241291), 159115 states have internal predecessors, (241291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159116 states to 159116 states and 241291 transitions. [2025-01-09 04:27:49,890 INFO L78 Accepts]: Start accepts. Automaton has 159116 states and 241291 transitions. Word has length 111 [2025-01-09 04:27:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:49,891 INFO L471 AbstractCegarLoop]: Abstraction has 159116 states and 241291 transitions. [2025-01-09 04:27:49,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 159116 states and 241291 transitions. [2025-01-09 04:27:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:27:49,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:49,897 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:27:49,897 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 528549714, now seen corresponding path program 1 times [2025-01-09 04:27:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031928400] [2025-01-09 04:27:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:49,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:27:49,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:27:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:27:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031928400] [2025-01-09 04:27:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031928400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188749876] [2025-01-09 04:27:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:49,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:49,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:49,966 INFO L87 Difference]: Start difference. First operand 159116 states and 241291 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:52,341 INFO L93 Difference]: Finished difference Result 336554 states and 511577 transitions. [2025-01-09 04:27:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:52,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 111 [2025-01-09 04:27:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:53,299 INFO L225 Difference]: With dead ends: 336554 [2025-01-09 04:27:53,300 INFO L226 Difference]: Without dead ends: 261260 [2025-01-09 04:27:53,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:53,398 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:53,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 367 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261260 states. [2025-01-09 04:27:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261260 to 260526. [2025-01-09 04:27:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260526 states, 260525 states have (on average 1.514422800115152) internal successors, (394545), 260525 states have internal predecessors, (394545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260526 states to 260526 states and 394545 transitions. [2025-01-09 04:27:58,752 INFO L78 Accepts]: Start accepts. Automaton has 260526 states and 394545 transitions. Word has length 111 [2025-01-09 04:27:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:58,753 INFO L471 AbstractCegarLoop]: Abstraction has 260526 states and 394545 transitions. [2025-01-09 04:27:58,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 260526 states and 394545 transitions. [2025-01-09 04:27:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:27:58,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:58,755 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:58,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:27:58,755 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:58,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1240493493, now seen corresponding path program 1 times [2025-01-09 04:27:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:58,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90308486] [2025-01-09 04:27:58,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:58,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:27:58,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:27:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90308486] [2025-01-09 04:27:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90308486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973651875] [2025-01-09 04:27:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:58,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:58,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:58,801 INFO L87 Difference]: Start difference. First operand 260526 states and 394545 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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)