./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.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_lcr-var-start-time.4.2.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 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:22:42,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:22:42,722 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:22:42,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:22:42,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:22:42,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:22:42,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:22:42,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:22:42,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:22:42,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:22:42,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:22:42,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:22:42,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:22:42,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:22:42,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:22:42,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:22:42,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:22:42,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:22:42,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:22:42,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:22:42,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:22:42,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:22:42,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:22:42,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:42,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:42,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:42,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:42,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:22:42,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:22:42,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:22:42,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:22:42,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:42,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:22:42,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:22:42,765 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 -> 927c21c2096a228a934a41e2a18844ff0d670b1b365a7d276a4e36116ab9babc [2025-01-09 04:22:43,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:22:43,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:22:43,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:22:43,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:22:43,063 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:22:43,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:44,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c454e71d/6b294204b4b443f08909220db1e6afc1/FLAG9ace5f164 [2025-01-09 04:22:44,617 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:22:44,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:44,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c454e71d/6b294204b4b443f08909220db1e6afc1/FLAG9ace5f164 [2025-01-09 04:22:44,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c454e71d/6b294204b4b443f08909220db1e6afc1 [2025-01-09 04:22:44,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:22:44,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:22:44,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:44,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:22:44,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:22:44,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:44,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359c797e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44, skipping insertion in model container [2025-01-09 04:22:44,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:44,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:22:44,900 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2025-01-09 04:22:44,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:44,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:22:44,958 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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c[9376,9389] [2025-01-09 04:22:44,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:22:44,974 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:22:44,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44 WrapperNode [2025-01-09 04:22:44,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:22:44,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:44,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:22:44,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:22:44,983 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:22:44" (1/1) ... [2025-01-09 04:22:44,994 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:22:44" (1/1) ... [2025-01-09 04:22:45,029 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 310 [2025-01-09 04:22:45,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:22:45,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:22:45,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:22:45,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:22:45,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,066 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:22:45,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:22:45,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:22:45,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:22:45,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:22:45,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (1/1) ... [2025-01-09 04:22:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:22:45,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:45,127 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:22:45,134 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:22:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:22:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:22:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:22:45,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:22:45,250 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:22:45,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:22:45,639 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-01-09 04:22:45,639 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:22:45,648 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:22:45,648 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:22:45,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:45 BoogieIcfgContainer [2025-01-09 04:22:45,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:22:45,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:22:45,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:22:45,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:22:45,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:22:44" (1/3) ... [2025-01-09 04:22:45,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633883f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:45, skipping insertion in model container [2025-01-09 04:22:45,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:44" (2/3) ... [2025-01-09 04:22:45,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633883f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:45, skipping insertion in model container [2025-01-09 04:22:45,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:45" (3/3) ... [2025-01-09 04:22:45,658 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c [2025-01-09 04:22:45,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:22:45,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:22:45,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:22:45,735 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;@7cf628c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:22:45,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:22:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 83 states have internal predecessors, (141), 0 states have call successors, (0), 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:22:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:22:45,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:45,746 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] [2025-01-09 04:22:45,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 468753537, now seen corresponding path program 1 times [2025-01-09 04:22:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976377014] [2025-01-09 04:22:45,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:45,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:22:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:22:45,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:45,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:45,967 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:22:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976377014] [2025-01-09 04:22:45,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976377014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:45,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:22:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602384594] [2025-01-09 04:22:45,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:45,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:22:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:22:45,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:22:45,993 INFO L87 Difference]: Start difference. First operand has 84 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 83 states have internal predecessors, (141), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:46,007 INFO L93 Difference]: Finished difference Result 136 states and 226 transitions. [2025-01-09 04:22:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:22:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-01-09 04:22:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:46,014 INFO L225 Difference]: With dead ends: 136 [2025-01-09 04:22:46,014 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 04:22:46,015 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:22:46,018 INFO L435 NwaCegarLoop]: 136 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, 136 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:22:46,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 04:22:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 04:22:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.7) internal successors, (136), 80 states have internal predecessors, (136), 0 states have call successors, (0), 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:22:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 136 transitions. [2025-01-09 04:22:46,060 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 136 transitions. Word has length 29 [2025-01-09 04:22:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:46,060 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 136 transitions. [2025-01-09 04:22:46,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 136 transitions. [2025-01-09 04:22:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:22:46,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:46,061 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] [2025-01-09 04:22:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:22:46,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:46,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash 334740031, now seen corresponding path program 1 times [2025-01-09 04:22:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049698607] [2025-01-09 04:22:46,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:46,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:22:46,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:22:46,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:46,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:46,369 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:22:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049698607] [2025-01-09 04:22:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049698607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:22:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866066535] [2025-01-09 04:22:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:46,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:22:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:46,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:22:46,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:22:46,373 INFO L87 Difference]: Start difference. First operand 81 states and 136 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:46,455 INFO L93 Difference]: Finished difference Result 136 states and 222 transitions. [2025-01-09 04:22:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:22:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-01-09 04:22:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:46,456 INFO L225 Difference]: With dead ends: 136 [2025-01-09 04:22:46,456 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 04:22:46,457 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:22:46,458 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:46,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 04:22:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 04:22:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 0 states have call successors, (0), 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:22:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2025-01-09 04:22:46,464 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 29 [2025-01-09 04:22:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:46,464 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2025-01-09 04:22:46,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:22:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2025-01-09 04:22:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:22:46,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:46,465 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] [2025-01-09 04:22:46,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:22:46,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:46,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1323776568, now seen corresponding path program 1 times [2025-01-09 04:22:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071416216] [2025-01-09 04:22:46,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:46,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:22:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:22:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:46,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:46,591 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:22:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:46,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071416216] [2025-01-09 04:22:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071416216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872701053] [2025-01-09 04:22:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:46,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:46,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:46,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:46,594 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:46,623 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2025-01-09 04:22:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 04:22:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:46,626 INFO L225 Difference]: With dead ends: 175 [2025-01-09 04:22:46,626 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 04:22:46,627 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:22:46,627 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 241 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:22:46,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 04:22:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-01-09 04:22:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4710743801652892) internal successors, (178), 121 states have internal predecessors, (178), 0 states have call successors, (0), 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:22:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 04:22:46,647 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 52 [2025-01-09 04:22:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 04:22:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 04:22:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:22:46,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:46,652 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] [2025-01-09 04:22:46,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:22:46,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:46,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1792760071, now seen corresponding path program 1 times [2025-01-09 04:22:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097438592] [2025-01-09 04:22:46,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:46,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:22:46,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:22:46,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:46,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:46,857 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:22:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:46,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097438592] [2025-01-09 04:22:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097438592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:46,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478559444] [2025-01-09 04:22:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:46,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:46,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:46,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:46,862 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:46,994 INFO L93 Difference]: Finished difference Result 582 states and 918 transitions. [2025-01-09 04:22:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 04:22:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:46,998 INFO L225 Difference]: With dead ends: 582 [2025-01-09 04:22:46,998 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 04:22:46,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:46,999 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 792 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:47,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 577 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 04:22:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 212. [2025-01-09 04:22:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.5213270142180095) internal successors, (321), 211 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2025-01-09 04:22:47,026 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 52 [2025-01-09 04:22:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:47,026 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2025-01-09 04:22:47,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:22:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2025-01-09 04:22:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:22:47,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:47,027 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] [2025-01-09 04:22:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:22:47,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash -124310732, now seen corresponding path program 1 times [2025-01-09 04:22:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:47,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504448347] [2025-01-09 04:22:47,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:47,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:22:47,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:22:47,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:47,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,394 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:22:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504448347] [2025-01-09 04:22:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504448347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:22:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636088238] [2025-01-09 04:22:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:47,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:22:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:47,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:22:47,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:22:47,397 INFO L87 Difference]: Start difference. First operand 212 states and 321 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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:22:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:47,453 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2025-01-09 04:22:47,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:22:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 04:22:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:47,455 INFO L225 Difference]: With dead ends: 226 [2025-01-09 04:22:47,455 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 04:22:47,456 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:22:47,457 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:47,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 04:22:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-01-09 04:22:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.493273542600897) internal successors, (333), 223 states have internal predecessors, (333), 0 states have call successors, (0), 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:22:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2025-01-09 04:22:47,478 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 53 [2025-01-09 04:22:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2025-01-09 04:22:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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:22:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2025-01-09 04:22:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:22:47,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:47,480 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] [2025-01-09 04:22:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:22:47,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:47,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:47,484 INFO L85 PathProgramCache]: Analyzing trace with hash 493913137, now seen corresponding path program 1 times [2025-01-09 04:22:47,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:47,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565895671] [2025-01-09 04:22:47,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:22:47,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:22:47,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:47,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,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:22:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565895671] [2025-01-09 04:22:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565895671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199486651] [2025-01-09 04:22:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:47,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:47,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:47,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:47,597 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:22:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:47,625 INFO L93 Difference]: Finished difference Result 582 states and 889 transitions. [2025-01-09 04:22:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 04:22:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:47,628 INFO L225 Difference]: With dead ends: 582 [2025-01-09 04:22:47,628 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 04:22:47,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:47,629 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:47,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 04:22:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 382. [2025-01-09 04:22:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.5039370078740157) internal successors, (573), 381 states have internal predecessors, (573), 0 states have call successors, (0), 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:22:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 573 transitions. [2025-01-09 04:22:47,653 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 573 transitions. Word has length 54 [2025-01-09 04:22:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 573 transitions. [2025-01-09 04:22:47,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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:22:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 573 transitions. [2025-01-09 04:22:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:22:47,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:47,655 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] [2025-01-09 04:22:47,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:22:47,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1392294733, now seen corresponding path program 1 times [2025-01-09 04:22:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738581863] [2025-01-09 04:22:47,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:47,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:22:47,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:22:47,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:47,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,739 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:22:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:47,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738581863] [2025-01-09 04:22:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738581863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124255364] [2025-01-09 04:22:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:47,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:47,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:47,741 INFO L87 Difference]: Start difference. First operand 382 states and 573 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:22:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:47,776 INFO L93 Difference]: Finished difference Result 1022 states and 1547 transitions. [2025-01-09 04:22:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:47,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:22:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:47,783 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 04:22:47,783 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 04:22:47,784 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:22:47,786 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 226 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:22:47,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 226 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 04:22:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2025-01-09 04:22:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 667 states have (on average 1.4917541229385307) internal successors, (995), 667 states have internal predecessors, (995), 0 states have call successors, (0), 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:22:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 995 transitions. [2025-01-09 04:22:47,810 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 995 transitions. Word has length 55 [2025-01-09 04:22:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 995 transitions. [2025-01-09 04:22:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:22:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 995 transitions. [2025-01-09 04:22:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:22:47,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:47,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] [2025-01-09 04:22:47,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:22:47,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:47,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash -408394195, now seen corresponding path program 1 times [2025-01-09 04:22:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:47,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914843694] [2025-01-09 04:22:47,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:22:47,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:22:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:47,877 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:22:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:47,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914843694] [2025-01-09 04:22:47,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914843694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:47,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:47,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218483779] [2025-01-09 04:22:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:47,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:47,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:47,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:47,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:47,880 INFO L87 Difference]: Start difference. First operand 668 states and 995 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:22:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:47,916 INFO L93 Difference]: Finished difference Result 1816 states and 2701 transitions. [2025-01-09 04:22:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:47,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:22:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:47,921 INFO L225 Difference]: With dead ends: 1816 [2025-01-09 04:22:47,921 INFO L226 Difference]: Without dead ends: 1178 [2025-01-09 04:22:47,922 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:22:47,923 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 239 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:22:47,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-01-09 04:22:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2025-01-09 04:22:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.4629787234042553) internal successors, (1719), 1175 states have internal predecessors, (1719), 0 states have call successors, (0), 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:22:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1719 transitions. [2025-01-09 04:22:47,977 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1719 transitions. Word has length 55 [2025-01-09 04:22:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1719 transitions. [2025-01-09 04:22:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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:22:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1719 transitions. [2025-01-09 04:22:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:22:47,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:47,981 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] [2025-01-09 04:22:47,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:22:47,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash 297210608, now seen corresponding path program 1 times [2025-01-09 04:22:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268832073] [2025-01-09 04:22:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:47,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:22:48,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:22:48,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:48,057 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:22:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268832073] [2025-01-09 04:22:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268832073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:48,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:48,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:48,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238926760] [2025-01-09 04:22:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:48,059 INFO L87 Difference]: Start difference. First operand 1176 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:22:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:48,106 INFO L93 Difference]: Finished difference Result 2319 states and 3421 transitions. [2025-01-09 04:22:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 04:22:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:48,114 INFO L225 Difference]: With dead ends: 2319 [2025-01-09 04:22:48,115 INFO L226 Difference]: Without dead ends: 1676 [2025-01-09 04:22:48,116 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:22:48,116 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 253 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:22:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-01-09 04:22:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1674. [2025-01-09 04:22:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 1.4542737597130904) internal successors, (2433), 1673 states have internal predecessors, (2433), 0 states have call successors, (0), 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:22:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2433 transitions. [2025-01-09 04:22:48,172 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2433 transitions. Word has length 56 [2025-01-09 04:22:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:48,173 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2433 transitions. [2025-01-09 04:22:48,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:22:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2433 transitions. [2025-01-09 04:22:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:22:48,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:48,175 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] [2025-01-09 04:22:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:22:48,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:48,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash -244343452, now seen corresponding path program 1 times [2025-01-09 04:22:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095305944] [2025-01-09 04:22:48,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:48,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:22:48,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:22:48,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:48,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:22:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095305944] [2025-01-09 04:22:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095305944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576206390] [2025-01-09 04:22:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:48,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:48,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:48,372 INFO L87 Difference]: Start difference. First operand 1674 states and 2433 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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:22:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:48,538 INFO L93 Difference]: Finished difference Result 4724 states and 6970 transitions. [2025-01-09 04:22:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 78 [2025-01-09 04:22:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:48,555 INFO L225 Difference]: With dead ends: 4724 [2025-01-09 04:22:48,556 INFO L226 Difference]: Without dead ends: 3890 [2025-01-09 04:22:48,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:48,561 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 527 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:48,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 610 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2025-01-09 04:22:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2482. [2025-01-09 04:22:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 1.456267634018541) internal successors, (3613), 2481 states have internal predecessors, (3613), 0 states have call successors, (0), 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:22:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3613 transitions. [2025-01-09 04:22:48,667 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3613 transitions. Word has length 78 [2025-01-09 04:22:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:48,667 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3613 transitions. [2025-01-09 04:22:48,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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:22:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3613 transitions. [2025-01-09 04:22:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:22:48,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:48,674 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:48,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:22:48,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:48,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash -946477051, now seen corresponding path program 1 times [2025-01-09 04:22:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237717168] [2025-01-09 04:22:48,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:48,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:22:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:22:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:22:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:48,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237717168] [2025-01-09 04:22:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237717168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163615806] [2025-01-09 04:22:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:48,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:48,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:48,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:48,828 INFO L87 Difference]: Start difference. First operand 2482 states and 3613 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:22:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:48,977 INFO L93 Difference]: Finished difference Result 5532 states and 8150 transitions. [2025-01-09 04:22:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 78 [2025-01-09 04:22:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:48,998 INFO L225 Difference]: With dead ends: 5532 [2025-01-09 04:22:48,998 INFO L226 Difference]: Without dead ends: 4698 [2025-01-09 04:22:49,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:49,003 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 515 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:49,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 595 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:22:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2025-01-09 04:22:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 3290. [2025-01-09 04:22:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3289 states have (on average 1.4572818485861965) internal successors, (4793), 3289 states have internal predecessors, (4793), 0 states have call successors, (0), 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:22:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 4793 transitions. [2025-01-09 04:22:49,146 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 4793 transitions. Word has length 78 [2025-01-09 04:22:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:49,146 INFO L471 AbstractCegarLoop]: Abstraction has 3290 states and 4793 transitions. [2025-01-09 04:22:49,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:22:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 4793 transitions. [2025-01-09 04:22:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:22:49,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:49,151 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:49,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:22:49,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1547801317, now seen corresponding path program 1 times [2025-01-09 04:22:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963375723] [2025-01-09 04:22:49,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:49,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:22:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:22:49,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:49,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:22:49,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963375723] [2025-01-09 04:22:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963375723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:49,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:49,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:22:49,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322085653] [2025-01-09 04:22:49,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:49,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:22:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:49,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:22:49,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:22:49,284 INFO L87 Difference]: Start difference. First operand 3290 states and 4793 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:22:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:49,464 INFO L93 Difference]: Finished difference Result 6340 states and 9330 transitions. [2025-01-09 04:22:49,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:22:49,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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 78 [2025-01-09 04:22:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:49,486 INFO L225 Difference]: With dead ends: 6340 [2025-01-09 04:22:49,487 INFO L226 Difference]: Without dead ends: 5506 [2025-01-09 04:22:49,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:22:49,489 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 479 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:49,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 628 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2025-01-09 04:22:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4098. [2025-01-09 04:22:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.457896021479131) internal successors, (5973), 4097 states have internal predecessors, (5973), 0 states have call successors, (0), 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:22:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5973 transitions. [2025-01-09 04:22:49,635 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5973 transitions. Word has length 78 [2025-01-09 04:22:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:49,636 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5973 transitions. [2025-01-09 04:22:49,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 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:22:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5973 transitions. [2025-01-09 04:22:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:22:49,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:49,638 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:49,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:22:49,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:49,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1609916664, now seen corresponding path program 1 times [2025-01-09 04:22:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937844063] [2025-01-09 04:22:49,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:49,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:49,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:49,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:49,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:49,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937844063] [2025-01-09 04:22:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937844063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533084058] [2025-01-09 04:22:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:49,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:49,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:49,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:49,747 INFO L87 Difference]: Start difference. First operand 4098 states and 5973 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:22:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:49,837 INFO L93 Difference]: Finished difference Result 8166 states and 11915 transitions. [2025-01-09 04:22:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:49,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:22:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:49,853 INFO L225 Difference]: With dead ends: 8166 [2025-01-09 04:22:49,853 INFO L226 Difference]: Without dead ends: 4100 [2025-01-09 04:22:49,859 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:22:49,860 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2025-01-09 04:22:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4098. [2025-01-09 04:22:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.4432511593849158) internal successors, (5913), 4097 states have internal predecessors, (5913), 0 states have call successors, (0), 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:22:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5913 transitions. [2025-01-09 04:22:50,004 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5913 transitions. Word has length 79 [2025-01-09 04:22:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:50,005 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 5913 transitions. [2025-01-09 04:22:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:22:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5913 transitions. [2025-01-09 04:22:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:22:50,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:50,007 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:22:50,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 124893175, now seen corresponding path program 1 times [2025-01-09 04:22:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418675279] [2025-01-09 04:22:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:50,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:50,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:50,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:50,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418675279] [2025-01-09 04:22:50,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418675279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:22:50,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:22:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:22:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076908534] [2025-01-09 04:22:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:22:50,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:22:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:50,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:22:50,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:22:50,119 INFO L87 Difference]: Start difference. First operand 4098 states and 5913 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:22:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:50,175 INFO L93 Difference]: Finished difference Result 6134 states and 8855 transitions. [2025-01-09 04:22:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:22:50,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-01-09 04:22:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:50,184 INFO L225 Difference]: With dead ends: 6134 [2025-01-09 04:22:50,184 INFO L226 Difference]: Without dead ends: 2068 [2025-01-09 04:22:50,211 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:22:50,211 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:50,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:22:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2025-01-09 04:22:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2066. [2025-01-09 04:22:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.425181598062954) internal successors, (2943), 2065 states have internal predecessors, (2943), 0 states have call successors, (0), 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:22:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2943 transitions. [2025-01-09 04:22:50,280 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2943 transitions. Word has length 79 [2025-01-09 04:22:50,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:22:50,280 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 2943 transitions. [2025-01-09 04:22:50,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:22:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2943 transitions. [2025-01-09 04:22:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:22:50,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:22:50,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:22:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:22:50,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:22:50,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:22:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 511141494, now seen corresponding path program 1 times [2025-01-09 04:22:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:22:50,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691288480] [2025-01-09 04:22:50,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:22:50,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:50,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:50,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:50,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:22:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691288480] [2025-01-09 04:22:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691288480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:22:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385835747] [2025-01-09 04:22:50,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:22:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:22:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:22:50,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:22:50,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:22:51,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:22:51,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:22:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:22:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:22:51,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 04:22:51,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:22:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:52,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:22:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:22:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385835747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:22:52,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:22:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 31 [2025-01-09 04:22:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811212456] [2025-01-09 04:22:52,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:22:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:22:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:22:52,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:22:52,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:22:52,766 INFO L87 Difference]: Start difference. First operand 2066 states and 2943 transitions. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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:22:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:22:59,795 INFO L93 Difference]: Finished difference Result 18719 states and 26482 transitions. [2025-01-09 04:22:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-09 04:22:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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 79 [2025-01-09 04:22:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:22:59,831 INFO L225 Difference]: With dead ends: 18719 [2025-01-09 04:22:59,831 INFO L226 Difference]: Without dead ends: 16685 [2025-01-09 04:22:59,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5638 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3254, Invalid=12246, Unknown=0, NotChecked=0, Total=15500 [2025-01-09 04:22:59,841 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 4788 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4788 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:22:59,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4788 Valid, 2220 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:22:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16685 states. [2025-01-09 04:23:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16685 to 14617. [2025-01-09 04:23:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14617 states, 14616 states have (on average 1.3900519978106185) internal successors, (20317), 14616 states have internal predecessors, (20317), 0 states have call successors, (0), 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:23:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14617 states to 14617 states and 20317 transitions. [2025-01-09 04:23:00,412 INFO L78 Accepts]: Start accepts. Automaton has 14617 states and 20317 transitions. Word has length 79 [2025-01-09 04:23:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 14617 states and 20317 transitions. [2025-01-09 04:23:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 0 states have call successors, (0), 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:23:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 14617 states and 20317 transitions. [2025-01-09 04:23:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:23:00,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:00,414 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:23:00,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:23:00,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 04:23:00,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:00,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1847483354, now seen corresponding path program 1 times [2025-01-09 04:23:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035408383] [2025-01-09 04:23:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:00,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:23:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:23:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:23:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:00,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035408383] [2025-01-09 04:23:00,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035408383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:23:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980126737] [2025-01-09 04:23:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:00,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:23:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:00,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:23:00,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:23:00,743 INFO L87 Difference]: Start difference. First operand 14617 states and 20317 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:23:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:01,167 INFO L93 Difference]: Finished difference Result 26679 states and 37394 transitions. [2025-01-09 04:23:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:23:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:23:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:01,218 INFO L225 Difference]: With dead ends: 26679 [2025-01-09 04:23:01,218 INFO L226 Difference]: Without dead ends: 23631 [2025-01-09 04:23:01,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:23:01,230 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 448 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:01,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 779 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23631 states. [2025-01-09 04:23:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23631 to 17520. [2025-01-09 04:23:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17520 states, 17519 states have (on average 1.3888920600490895) internal successors, (24332), 17519 states have internal predecessors, (24332), 0 states have call successors, (0), 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:23:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17520 states to 17520 states and 24332 transitions. [2025-01-09 04:23:01,807 INFO L78 Accepts]: Start accepts. Automaton has 17520 states and 24332 transitions. Word has length 80 [2025-01-09 04:23:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:01,808 INFO L471 AbstractCegarLoop]: Abstraction has 17520 states and 24332 transitions. [2025-01-09 04:23:01,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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:23:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17520 states and 24332 transitions. [2025-01-09 04:23:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:23:01,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:01,811 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:23:01,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:23:01,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2039704347, now seen corresponding path program 1 times [2025-01-09 04:23:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329304692] [2025-01-09 04:23:01,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:23:01,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:23:01,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:01,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329304692] [2025-01-09 04:23:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329304692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672782049] [2025-01-09 04:23:02,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:02,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:02,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:02,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:23:02,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:23:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:23:02,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:23:02,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:02,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:02,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:23:02,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:02,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672782049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:03,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 04:23:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16593465] [2025-01-09 04:23:03,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:23:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:03,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:23:03,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:23:03,678 INFO L87 Difference]: Start difference. First operand 17520 states and 24332 transitions. Second operand has 22 states, 22 states have (on average 8.681818181818182) internal successors, (191), 21 states have internal predecessors, (191), 0 states have call successors, (0), 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:23:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:04,896 INFO L93 Difference]: Finished difference Result 74491 states and 104200 transitions. [2025-01-09 04:23:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:23:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.681818181818182) internal successors, (191), 21 states have internal predecessors, (191), 0 states have call successors, (0), 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 83 [2025-01-09 04:23:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:05,028 INFO L225 Difference]: With dead ends: 74491 [2025-01-09 04:23:05,029 INFO L226 Difference]: Without dead ends: 57182 [2025-01-09 04:23:05,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 04:23:05,057 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1435 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:05,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1075 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:23:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2025-01-09 04:23:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 40982. [2025-01-09 04:23:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40982 states, 40981 states have (on average 1.3783948659134722) internal successors, (56488), 40981 states have internal predecessors, (56488), 0 states have call successors, (0), 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:23:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40982 states to 40982 states and 56488 transitions. [2025-01-09 04:23:06,289 INFO L78 Accepts]: Start accepts. Automaton has 40982 states and 56488 transitions. Word has length 83 [2025-01-09 04:23:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:06,290 INFO L471 AbstractCegarLoop]: Abstraction has 40982 states and 56488 transitions. [2025-01-09 04:23:06,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.681818181818182) internal successors, (191), 21 states have internal predecessors, (191), 0 states have call successors, (0), 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:23:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 40982 states and 56488 transitions. [2025-01-09 04:23:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 04:23:06,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:06,293 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:23:06,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:23:06,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 04:23:06,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2014402013, now seen corresponding path program 1 times [2025-01-09 04:23:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123188178] [2025-01-09 04:23:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:06,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:23:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:23:06,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:06,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123188178] [2025-01-09 04:23:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123188178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494262101] [2025-01-09 04:23:08,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:08,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:23:08,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:23:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 04:23:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 04:23:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:08,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 04:23:08,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:09,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494262101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:11,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:11,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-01-09 04:23:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533814] [2025-01-09 04:23:11,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:11,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:23:11,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:11,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:23:11,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:23:11,005 INFO L87 Difference]: Start difference. First operand 40982 states and 56488 transitions. Second operand has 31 states, 31 states have (on average 7.064516129032258) internal successors, (219), 31 states have internal predecessors, (219), 0 states have call successors, (0), 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:23:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:17,812 INFO L93 Difference]: Finished difference Result 203638 states and 278790 transitions. [2025-01-09 04:23:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 04:23:17,812 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.064516129032258) internal successors, (219), 31 states have internal predecessors, (219), 0 states have call successors, (0), 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 83 [2025-01-09 04:23:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:18,054 INFO L225 Difference]: With dead ends: 203638 [2025-01-09 04:23:18,054 INFO L226 Difference]: Without dead ends: 162740 [2025-01-09 04:23:18,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1370, Invalid=6286, Unknown=0, NotChecked=0, Total=7656 [2025-01-09 04:23:18,115 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 3396 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:18,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 1227 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:23:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162740 states. [2025-01-09 04:23:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162740 to 134234. [2025-01-09 04:23:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134234 states, 134233 states have (on average 1.3594347142654937) internal successors, (182481), 134233 states have internal predecessors, (182481), 0 states have call successors, (0), 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:23:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134234 states to 134234 states and 182481 transitions. [2025-01-09 04:23:22,012 INFO L78 Accepts]: Start accepts. Automaton has 134234 states and 182481 transitions. Word has length 83 [2025-01-09 04:23:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:22,014 INFO L471 AbstractCegarLoop]: Abstraction has 134234 states and 182481 transitions. [2025-01-09 04:23:22,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.064516129032258) internal successors, (219), 31 states have internal predecessors, (219), 0 states have call successors, (0), 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:23:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 134234 states and 182481 transitions. [2025-01-09 04:23:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 04:23:22,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:22,016 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:23:22,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:23:22,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:22,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1349238370, now seen corresponding path program 1 times [2025-01-09 04:23:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:22,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865889243] [2025-01-09 04:23:22,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:22,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 04:23:22,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 04:23:22,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:22,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865889243] [2025-01-09 04:23:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865889243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808470422] [2025-01-09 04:23:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:22,505 INFO L87 Difference]: Start difference. First operand 134234 states and 182481 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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:23:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:27,886 INFO L93 Difference]: Finished difference Result 386587 states and 524836 transitions. [2025-01-09 04:23:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:27,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-01-09 04:23:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:28,271 INFO L225 Difference]: With dead ends: 386587 [2025-01-09 04:23:28,271 INFO L226 Difference]: Without dead ends: 252537 [2025-01-09 04:23:28,365 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:23:28,366 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:28,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252537 states.