./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d842525d6c024e37f889e3e19a1cef4a07157b3d33d75f554921b8e5a37c2dd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:09:43,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:09:43,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:09:43,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:09:43,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:09:43,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:09:43,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:09:43,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:09:43,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:09:43,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:09:43,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:09:43,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:09:43,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:09:43,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:09:43,305 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:09:43,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:09:43,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:43,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:09:43,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:09:43,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:09:43,307 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d842525d6c024e37f889e3e19a1cef4a07157b3d33d75f554921b8e5a37c2dd0 [2025-02-08 00:09:43,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:09:43,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:09:43,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:09:43,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:09:43,805 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:09:43,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c [2025-02-08 00:09:45,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00fe02f24/733b42cba7c343c69b1bd525058f0a4d/FLAGc8fa7f993 [2025-02-08 00:09:45,844 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:09:45,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c [2025-02-08 00:09:45,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00fe02f24/733b42cba7c343c69b1bd525058f0a4d/FLAGc8fa7f993 [2025-02-08 00:09:45,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00fe02f24/733b42cba7c343c69b1bd525058f0a4d [2025-02-08 00:09:45,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:09:45,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:09:45,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:45,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:09:45,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:09:45,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:45" (1/1) ... [2025-02-08 00:09:45,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94c20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:45, skipping insertion in model container [2025-02-08 00:09:45,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:09:45" (1/1) ... [2025-02-08 00:09:45,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:09:46,058 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c[1266,1279] [2025-02-08 00:09:46,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:46,101 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:09:46,108 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c[1266,1279] [2025-02-08 00:09:46,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:09:46,138 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:09:46,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46 WrapperNode [2025-02-08 00:09:46,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:09:46,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:46,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:09:46,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:09:46,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,202 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-02-08 00:09:46,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:09:46,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:09:46,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:09:46,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:09:46,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,248 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-02-08 00:09:46,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:09:46,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:09:46,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:09:46,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:09:46,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (1/1) ... [2025-02-08 00:09:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:09:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:46,329 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-02-08 00:09:46,335 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-02-08 00:09:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:09:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:09:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:09:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:09:46,421 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:09:46,423 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:09:46,771 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-08 00:09:46,771 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:09:46,791 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:09:46,792 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:09:46,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:46 BoogieIcfgContainer [2025-02-08 00:09:46,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:09:46,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:09:46,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:09:46,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:09:46,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:09:45" (1/3) ... [2025-02-08 00:09:46,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f896eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:46, skipping insertion in model container [2025-02-08 00:09:46,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:09:46" (2/3) ... [2025-02-08 00:09:46,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f896eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:09:46, skipping insertion in model container [2025-02-08 00:09:46,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:46" (3/3) ... [2025-02-08 00:09:46,805 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c [2025-02-08 00:09:46,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:09:46,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p16.c that has 1 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:09:46,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:09:46,883 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;@3b315701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:09:46,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:09:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 00:09:46,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:46,895 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] [2025-02-08 00:09:46,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1153006408, now seen corresponding path program 1 times [2025-02-08 00:09:46,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:46,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592748925] [2025-02-08 00:09:46,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:46,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 00:09:47,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 00:09:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592748925] [2025-02-08 00:09:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592748925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629032233] [2025-02-08 00:09:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:47,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:47,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:47,352 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:47,413 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2025-02-08 00:09:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:47,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-08 00:09:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:47,420 INFO L225 Difference]: With dead ends: 75 [2025-02-08 00:09:47,420 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 00:09:47,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:47,425 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:47,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 00:09:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 00:09:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2025-02-08 00:09:47,450 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 20 [2025-02-08 00:09:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:47,450 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2025-02-08 00:09:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2025-02-08 00:09:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 00:09:47,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:47,453 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] [2025-02-08 00:09:47,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:09:47,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1388139430, now seen corresponding path program 1 times [2025-02-08 00:09:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122416452] [2025-02-08 00:09:47,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:47,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 00:09:47,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 00:09:47,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:47,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122416452] [2025-02-08 00:09:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122416452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:47,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107028148] [2025-02-08 00:09:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:47,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:47,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:47,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:47,629 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:47,674 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2025-02-08 00:09:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:47,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-08 00:09:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:47,675 INFO L225 Difference]: With dead ends: 77 [2025-02-08 00:09:47,675 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 00:09:47,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:47,676 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:47,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 00:09:47,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 00:09:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2025-02-08 00:09:47,683 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 21 [2025-02-08 00:09:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:47,683 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2025-02-08 00:09:47,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2025-02-08 00:09:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 00:09:47,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:47,684 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] [2025-02-08 00:09:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:09:47,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2014158595, now seen corresponding path program 1 times [2025-02-08 00:09:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530301466] [2025-02-08 00:09:47,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:47,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 00:09:47,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 00:09:47,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:47,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530301466] [2025-02-08 00:09:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530301466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:47,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246780314] [2025-02-08 00:09:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:09:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:47,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:09:47,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:47,990 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:48,048 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2025-02-08 00:09:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:09:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-02-08 00:09:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:48,049 INFO L225 Difference]: With dead ends: 79 [2025-02-08 00:09:48,049 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 00:09:48,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:09:48,052 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:48,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 00:09:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 00:09:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-02-08 00:09:48,055 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 22 [2025-02-08 00:09:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:48,055 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-02-08 00:09:48,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-02-08 00:09:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 00:09:48,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:48,056 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] [2025-02-08 00:09:48,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:09:48,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:48,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash -97230485, now seen corresponding path program 1 times [2025-02-08 00:09:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:48,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343399233] [2025-02-08 00:09:48,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:48,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:48,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 00:09:48,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 00:09:48,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:48,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343399233] [2025-02-08 00:09:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343399233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:48,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:09:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180499850] [2025-02-08 00:09:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:48,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:09:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:48,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:09:48,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:09:48,422 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:48,578 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2025-02-08 00:09:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:09:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 00:09:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:48,580 INFO L225 Difference]: With dead ends: 91 [2025-02-08 00:09:48,580 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 00:09:48,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:09:48,581 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 00:09:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-08 00:09:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2025-02-08 00:09:48,585 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 23 [2025-02-08 00:09:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2025-02-08 00:09:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2025-02-08 00:09:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 00:09:48,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:48,586 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] [2025-02-08 00:09:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:09:48,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1686993226, now seen corresponding path program 1 times [2025-02-08 00:09:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379586630] [2025-02-08 00:09:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 00:09:48,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:09:48,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:48,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379586630] [2025-02-08 00:09:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379586630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:48,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:48,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964190272] [2025-02-08 00:09:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:48,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:48,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:48,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:48,982 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:49,057 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2025-02-08 00:09:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:49,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-08 00:09:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:49,062 INFO L225 Difference]: With dead ends: 105 [2025-02-08 00:09:49,062 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 00:09:49,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:09:49,063 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:49,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 132 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 00:09:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-08 00:09:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-02-08 00:09:49,071 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2025-02-08 00:09:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:49,071 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-02-08 00:09:49,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2025-02-08 00:09:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 00:09:49,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:49,072 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] [2025-02-08 00:09:49,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:09:49,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:49,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1367738028, now seen corresponding path program 1 times [2025-02-08 00:09:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:49,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987660301] [2025-02-08 00:09:49,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:49,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 00:09:49,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:09:49,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:49,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:49,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987660301] [2025-02-08 00:09:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987660301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:09:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521744766] [2025-02-08 00:09:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:49,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:09:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:49,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:09:49,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:09:49,391 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:49,489 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2025-02-08 00:09:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:09:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-08 00:09:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:49,491 INFO L225 Difference]: With dead ends: 111 [2025-02-08 00:09:49,491 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 00:09:49,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:09:49,492 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:49,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 251 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 00:09:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-02-08 00:09:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2025-02-08 00:09:49,496 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 24 [2025-02-08 00:09:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:49,496 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2025-02-08 00:09:49,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2025-02-08 00:09:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 00:09:49,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:49,497 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] [2025-02-08 00:09:49,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:09:49,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:49,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2064070471, now seen corresponding path program 1 times [2025-02-08 00:09:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024152904] [2025-02-08 00:09:49,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:49,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 00:09:49,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 00:09:49,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:49,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024152904] [2025-02-08 00:09:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024152904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:49,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:09:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048914348] [2025-02-08 00:09:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:09:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:09:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:49,678 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:49,869 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2025-02-08 00:09:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-08 00:09:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:49,870 INFO L225 Difference]: With dead ends: 153 [2025-02-08 00:09:49,870 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 00:09:49,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:49,871 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 210 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:49,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 70 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 00:09:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 64. [2025-02-08 00:09:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2025-02-08 00:09:49,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 24 [2025-02-08 00:09:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:49,876 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2025-02-08 00:09:49,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2025-02-08 00:09:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 00:09:49,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:49,877 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] [2025-02-08 00:09:49,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:09:49,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:49,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1698146621, now seen corresponding path program 1 times [2025-02-08 00:09:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978203917] [2025-02-08 00:09:49,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:49,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:09:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:09:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978203917] [2025-02-08 00:09:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978203917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:50,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:09:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745262550] [2025-02-08 00:09:50,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:50,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:09:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:50,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:09:50,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:50,045 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:50,204 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2025-02-08 00:09:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:09:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 00:09:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:50,205 INFO L225 Difference]: With dead ends: 153 [2025-02-08 00:09:50,205 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 00:09:50,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:09:50,206 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 121 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:50,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 53 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 00:09:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 71. [2025-02-08 00:09:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-02-08 00:09:50,210 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 25 [2025-02-08 00:09:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:50,210 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-02-08 00:09:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-02-08 00:09:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 00:09:50,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:50,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:50,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:09:50,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:50,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 619069902, now seen corresponding path program 1 times [2025-02-08 00:09:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113545689] [2025-02-08 00:09:50,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:50,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 00:09:50,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:09:50,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:50,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:50,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113545689] [2025-02-08 00:09:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113545689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:50,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:50,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139234356] [2025-02-08 00:09:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:50,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:50,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:50,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:50,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:50,331 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:50,378 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2025-02-08 00:09:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 00:09:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:50,379 INFO L225 Difference]: With dead ends: 146 [2025-02-08 00:09:50,379 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 00:09:50,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:50,380 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 110 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:50,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 132 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 00:09:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 66. [2025-02-08 00:09:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2025-02-08 00:09:50,384 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 25 [2025-02-08 00:09:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:50,384 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2025-02-08 00:09:50,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2025-02-08 00:09:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:09:50,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:50,385 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] [2025-02-08 00:09:50,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:09:50,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:50,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 994011917, now seen corresponding path program 1 times [2025-02-08 00:09:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524709279] [2025-02-08 00:09:50,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:50,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:09:50,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:09:50,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:50,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524709279] [2025-02-08 00:09:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524709279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:09:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:09:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:09:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419131757] [2025-02-08 00:09:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:09:50,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:09:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:09:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:09:50,488 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:50,532 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-02-08 00:09:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:09:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-08 00:09:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:50,534 INFO L225 Difference]: With dead ends: 124 [2025-02-08 00:09:50,534 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 00:09:50,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:09:50,535 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 78 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:50,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 132 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:09:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 00:09:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2025-02-08 00:09:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2025-02-08 00:09:50,540 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 26 [2025-02-08 00:09:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:50,540 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-02-08 00:09:50,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2025-02-08 00:09:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 00:09:50,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:50,541 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 00:09:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:09:50,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:50,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1895598097, now seen corresponding path program 1 times [2025-02-08 00:09:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:50,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916820075] [2025-02-08 00:09:50,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:50,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:09:50,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:09:50,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:50,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:50,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916820075] [2025-02-08 00:09:50,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916820075] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:50,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18965530] [2025-02-08 00:09:50,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:50,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:50,780 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-02-08 00:09:50,782 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-02-08 00:09:50,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 00:09:50,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 00:09:50,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:50,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:50,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 00:09:50,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 00:09:51,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 00:09:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18965530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:51,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-08 00:09:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828785182] [2025-02-08 00:09:51,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 00:09:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 00:09:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:09:51,376 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:51,608 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2025-02-08 00:09:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:09:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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 40 [2025-02-08 00:09:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:51,611 INFO L225 Difference]: With dead ends: 112 [2025-02-08 00:09:51,611 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 00:09:51,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:09:51,612 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 103 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:51,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 115 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 00:09:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 00:09:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 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-02-08 00:09:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-02-08 00:09:51,621 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 40 [2025-02-08 00:09:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-02-08 00:09:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-02-08 00:09:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 00:09:51,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:09:51,622 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] [2025-02-08 00:09:51,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:09:51,823 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,SelfDestructingSolverStorable10 [2025-02-08 00:09:51,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:09:51,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:09:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash -133405127, now seen corresponding path program 1 times [2025-02-08 00:09:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:09:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805699152] [2025-02-08 00:09:51,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:09:51,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 00:09:51,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 00:09:51,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:09:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805699152] [2025-02-08 00:09:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805699152] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:09:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682907009] [2025-02-08 00:09:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:09:52,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:09:52,158 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-02-08 00:09:52,159 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-02-08 00:09:52,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 00:09:52,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 00:09:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:09:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:09:52,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 00:09:52,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:09:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:52,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:09:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:09:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682907009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:09:52,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:09:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 19 [2025-02-08 00:09:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374089949] [2025-02-08 00:09:52,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:09:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:09:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:09:52,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:09:52,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:09:52,789 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:09:52,994 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2025-02-08 00:09:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:09:52,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 42 [2025-02-08 00:09:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:09:52,994 INFO L225 Difference]: With dead ends: 82 [2025-02-08 00:09:52,994 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 00:09:52,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:09:52,995 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:09:52,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 60 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:09:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 00:09:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 00:09:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 00:09:52,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-02-08 00:09:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:09:52,996 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 00:09:52,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:09:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 00:09:52,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 00:09:52,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:09:53,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 00:09:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:09:53,207 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:09:53,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 00:09:53,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:09:53,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:09:53 BoogieIcfgContainer [2025-02-08 00:09:53,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:09:53,250 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:09:53,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:09:53,250 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:09:53,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:09:46" (3/4) ... [2025-02-08 00:09:53,252 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 00:09:53,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 00:09:53,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 00:09:53,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 00:09:53,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 00:09:53,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:09:53,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:09:53,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:09:53,409 INFO L158 Benchmark]: Toolchain (without parser) took 7508.24ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.8MB in the beginning and 185.5MB in the end (delta: -72.7MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.66ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.57ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 95.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: Boogie Preprocessor took 77.33ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: IcfgBuilder took 511.12ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 65.1MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: TraceAbstraction took 6454.53ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 64.5MB in the beginning and 193.8MB in the end (delta: -129.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:53,413 INFO L158 Benchmark]: Witness Printer took 158.18ms. Allocated memory is still 268.4MB. Free memory was 193.8MB in the beginning and 185.5MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:09:53,415 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.66ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 99.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.57ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 95.2MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.33ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 511.12ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 65.1MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6454.53ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 64.5MB in the beginning and 193.8MB in the end (delta: -129.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 158.18ms. Allocated memory is still 268.4MB. Free memory was 193.8MB in the beginning and 185.5MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 875 mSDsluCounter, 1590 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1159 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1279 IncrementalHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 431 mSDtfsCounter, 1279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=8, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 115 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 2443 SizeOfPredicates, 6 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 65/78 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Location Invariant Derived location invariant: ((((((var_12 == 1) && (state_8 == 0)) && (state_15 == 0)) && (var_22 == 1)) && (mask_SORT_1 == 1)) && (var_7 == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-08 00:09:53,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE