./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal58.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.cal58.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 716547a7fbdfceb31d193aabba3879422257a24dd737c70a32b939b695035c3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:46:07,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:46:07,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:46:07,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:46:07,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:46:07,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:46:07,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:46:07,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:46:07,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:46:07,796 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:46:07,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:46:07,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:46:07,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:46:07,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:46:07,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:46:07,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:07,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:46:07,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:46:07,799 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 -> 716547a7fbdfceb31d193aabba3879422257a24dd737c70a32b939b695035c3c [2025-02-07 22:46:08,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:46:08,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:46:08,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:46:08,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:46:08,050 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:46:08,051 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.cal58.c [2025-02-07 22:46:09,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb62fb7e/58180b4494654d63b8aeb3ab1693a764/FLAG372acaeef [2025-02-07 22:46:09,486 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:46:09,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal58.c [2025-02-07 22:46:09,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb62fb7e/58180b4494654d63b8aeb3ab1693a764/FLAG372acaeef [2025-02-07 22:46:09,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eb62fb7e/58180b4494654d63b8aeb3ab1693a764 [2025-02-07 22:46:09,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:46:09,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:46:09,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:09,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:46:09,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:46:09,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:09" (1/1) ... [2025-02-07 22:46:09,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce4b9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:09, skipping insertion in model container [2025-02-07 22:46:09,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:09" (1/1) ... [2025-02-07 22:46:09,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:46:09,899 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.cal58.c[1245,1258] [2025-02-07 22:46:09,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:09,960 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:46:09,966 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.cal58.c[1245,1258] [2025-02-07 22:46:09,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:10,012 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:46:10,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10 WrapperNode [2025-02-07 22:46:10,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:10,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:10,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:46:10,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:46:10,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,054 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2025-02-07 22:46:10,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:10,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:46:10,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:46:10,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:46:10,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,088 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:46:10,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:46:10,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:46:10,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:46:10,117 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:46:10,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (1/1) ... [2025-02-07 22:46:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:10,142 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-07 22:46:10,144 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-07 22:46:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:46:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:46:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:46:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:46:10,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:46:10,216 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:46:10,218 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:46:10,633 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-02-07 22:46:10,633 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:46:10,661 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:46:10,662 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:46:10,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:10 BoogieIcfgContainer [2025-02-07 22:46:10,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:46:10,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:46:10,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:46:10,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:46:10,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:46:09" (1/3) ... [2025-02-07 22:46:10,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fc08b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:10, skipping insertion in model container [2025-02-07 22:46:10,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:10" (2/3) ... [2025-02-07 22:46:10,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fc08b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:10, skipping insertion in model container [2025-02-07 22:46:10,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:10" (3/3) ... [2025-02-07 22:46:10,670 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal58.c [2025-02-07 22:46:10,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:46:10,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal58.c that has 1 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:46:10,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:46:10,733 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;@521b915b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:46:10,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:46:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 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-07 22:46:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 22:46:10,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:10,741 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-07 22:46:10,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:10,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash 904060800, now seen corresponding path program 1 times [2025-02-07 22:46:10,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701680824] [2025-02-07 22:46:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 22:46:10,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 22:46:10,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:10,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:11,251 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-07 22:46:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701680824] [2025-02-07 22:46:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701680824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:11,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680785929] [2025-02-07 22:46:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:11,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:11,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:11,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:11,272 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 0 states have call successors, (0), 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 6.5) 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-07 22:46:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:11,348 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2025-02-07 22:46:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) 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-07 22:46:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:11,355 INFO L225 Difference]: With dead ends: 111 [2025-02-07 22:46:11,355 INFO L226 Difference]: Without dead ends: 64 [2025-02-07 22:46:11,357 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-07 22:46:11,359 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:11,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:11,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-07 22:46:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-07 22:46:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 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-07 22:46:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2025-02-07 22:46:11,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 26 [2025-02-07 22:46:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:11,381 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2025-02-07 22:46:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) 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-07 22:46:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2025-02-07 22:46:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 22:46:11,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:11,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:46:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:46:11,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:11,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2034207108, now seen corresponding path program 1 times [2025-02-07 22:46:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642585582] [2025-02-07 22:46:11,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:11,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 22:46:11,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 22:46:11,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:11,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:11,573 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-07 22:46:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642585582] [2025-02-07 22:46:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642585582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:46:11,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360515456] [2025-02-07 22:46:11,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:11,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:11,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:11,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:11,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:11,578 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-07 22:46:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:11,646 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2025-02-07 22:46:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-07 22:46:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:11,651 INFO L225 Difference]: With dead ends: 113 [2025-02-07 22:46:11,651 INFO L226 Difference]: Without dead ends: 66 [2025-02-07 22:46:11,651 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-07 22:46:11,652 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:11,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-07 22:46:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-07 22:46:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 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-07 22:46:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2025-02-07 22:46:11,658 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 27 [2025-02-07 22:46:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:11,660 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2025-02-07 22:46:11,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-07 22:46:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2025-02-07 22:46:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 22:46:11,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:11,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:46:11,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:46:11,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:11,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash -999368965, now seen corresponding path program 1 times [2025-02-07 22:46:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343086996] [2025-02-07 22:46:11,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 22:46:11,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 22:46:11,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:11,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:11,978 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-07 22:46:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:11,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343086996] [2025-02-07 22:46:11,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343086996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:46:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624358686] [2025-02-07 22:46:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:11,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:46:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:11,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:46:11,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:46:11,981 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 22:46:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:12,093 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2025-02-07 22:46:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:46:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-07 22:46:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:12,095 INFO L225 Difference]: With dead ends: 152 [2025-02-07 22:46:12,096 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 22:46:12,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:46:12,097 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 179 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:12,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 268 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 22:46:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2025-02-07 22:46:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 0 states have call successors, (0), 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-07 22:46:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-02-07 22:46:12,107 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 28 [2025-02-07 22:46:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:12,108 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-02-07 22:46:12,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 22:46:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-02-07 22:46:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 22:46:12,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:12,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:46:12,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:46:12,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:12,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash 972695681, now seen corresponding path program 1 times [2025-02-07 22:46:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216310447] [2025-02-07 22:46:12,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:12,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 22:46:12,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 22:46:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:12,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-07 22:46:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216310447] [2025-02-07 22:46:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216310447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:12,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:46:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211036038] [2025-02-07 22:46:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:46:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:12,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:46:12,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:46:12,391 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:12,534 INFO L93 Difference]: Finished difference Result 154 states and 216 transitions. [2025-02-07 22:46:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:46:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-07 22:46:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:12,535 INFO L225 Difference]: With dead ends: 154 [2025-02-07 22:46:12,535 INFO L226 Difference]: Without dead ends: 105 [2025-02-07 22:46:12,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:46:12,536 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 182 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:12,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 391 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-07 22:46:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2025-02-07 22:46:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 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-07 22:46:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2025-02-07 22:46:12,540 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 29 [2025-02-07 22:46:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:12,541 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2025-02-07 22:46:12,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2025-02-07 22:46:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 22:46:12,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:12,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:46:12,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:46:12,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -184490992, now seen corresponding path program 1 times [2025-02-07 22:46:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927538829] [2025-02-07 22:46:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:12,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 22:46:12,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 22:46:12,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:12,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:12,894 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-07 22:46:12,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:46:12,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927538829] [2025-02-07 22:46:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927538829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:46:12,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625888240] [2025-02-07 22:46:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:46:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:46:12,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:46:12,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:46:12,897 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-07 22:46:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:13,078 INFO L93 Difference]: Finished difference Result 154 states and 215 transitions. [2025-02-07 22:46:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:46:13,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-07 22:46:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:13,079 INFO L225 Difference]: With dead ends: 154 [2025-02-07 22:46:13,079 INFO L226 Difference]: Without dead ends: 105 [2025-02-07 22:46:13,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:46:13,080 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:13,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 377 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-07 22:46:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2025-02-07 22:46:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-02-07 22:46:13,085 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 30 [2025-02-07 22:46:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:13,085 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-02-07 22:46:13,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-07 22:46:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-02-07 22:46:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 22:46:13,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:13,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:46:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:46:13,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1442499715, now seen corresponding path program 1 times [2025-02-07 22:46:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:46:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894702578] [2025-02-07 22:46:13,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:46:13,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:46:13,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:46:13,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:46:13,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:46:13,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 22:46:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 22:46:13,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:13,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:46:13,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:46:13,151 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:46:13,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:46:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:46:13,155 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-07 22:46:13,169 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:46:13,173 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:46:13,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:46:13 BoogieIcfgContainer [2025-02-07 22:46:13,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:46:13,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:46:13,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:46:13,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:46:13,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:10" (3/4) ... [2025-02-07 22:46:13,178 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:46:13,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:46:13,179 INFO L158 Benchmark]: Toolchain (without parser) took 3390.37ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 122.3MB in the beginning and 128.2MB in the end (delta: -5.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2025-02-07 22:46:13,179 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:46:13,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.34ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:46:13,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.55ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 101.4MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:46:13,180 INFO L158 Benchmark]: Boogie Preprocessor took 61.76ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 97.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:46:13,180 INFO L158 Benchmark]: IcfgBuilder took 545.83ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 58.5MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 22:46:13,180 INFO L158 Benchmark]: TraceAbstraction took 2511.26ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 57.6MB in the beginning and 128.2MB in the end (delta: -70.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:46:13,180 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 209.7MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:46:13,181 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.34ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.55ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 101.4MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.76ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 97.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.83ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 58.5MB in the end (delta: 38.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2511.26ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 57.6MB in the beginning and 128.2MB in the end (delta: -70.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 209.7MB. Free memory was 128.2MB in the beginning and 128.2MB in the end (delta: 50.8kB). 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 4; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=4, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=4, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=4, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=4, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=4, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=4, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=4, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=4, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=4, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=4, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=4, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=4, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=4, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=4, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=4, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=4, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1467 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1123 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 509 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 344 mSDtfsCounter, 509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 22:46:13,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.cal58.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 716547a7fbdfceb31d193aabba3879422257a24dd737c70a32b939b695035c3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:46:15,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:46:15,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:46:15,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:46:15,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:46:15,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:46:15,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:46:15,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:46:15,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:46:15,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:46:15,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:46:15,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:46:15,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:46:15,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:46:15,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:46:15,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:15,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:46:15,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:46:15,258 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 -> 716547a7fbdfceb31d193aabba3879422257a24dd737c70a32b939b695035c3c [2025-02-07 22:46:15,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:46:15,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:46:15,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:46:15,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:46:15,507 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:46:15,514 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.cal58.c [2025-02-07 22:46:16,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd2a90454/b76c853f33764ffabc944b0499caa3e4/FLAGba7bb592b [2025-02-07 22:46:17,050 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:46:17,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal58.c [2025-02-07 22:46:17,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd2a90454/b76c853f33764ffabc944b0499caa3e4/FLAGba7bb592b [2025-02-07 22:46:17,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd2a90454/b76c853f33764ffabc944b0499caa3e4 [2025-02-07 22:46:17,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:46:17,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:46:17,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:17,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:46:17,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:46:17,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e1381f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17, skipping insertion in model container [2025-02-07 22:46:17,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:46:17,218 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.cal58.c[1245,1258] [2025-02-07 22:46:17,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:17,287 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:46:17,297 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.cal58.c[1245,1258] [2025-02-07 22:46:17,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:46:17,336 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:46:17,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17 WrapperNode [2025-02-07 22:46:17,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:46:17,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:17,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:46:17,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:46:17,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,381 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2025-02-07 22:46:17,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:46:17,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:46:17,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:46:17,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:46:17,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,409 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 22:46:17,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:46:17,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:46:17,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:46:17,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:46:17,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (1/1) ... [2025-02-07 22:46:17,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:46:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:17,461 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-07 22:46:17,465 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-07 22:46:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:46:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:46:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 22:46:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:46:17,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:46:17,540 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:46:17,542 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:46:17,730 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-07 22:46:17,730 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:46:17,736 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:46:17,736 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:46:17,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:17 BoogieIcfgContainer [2025-02-07 22:46:17,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:46:17,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:46:17,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:46:17,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:46:17,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:46:17" (1/3) ... [2025-02-07 22:46:17,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6655c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:17, skipping insertion in model container [2025-02-07 22:46:17,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:46:17" (2/3) ... [2025-02-07 22:46:17,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6655c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:46:17, skipping insertion in model container [2025-02-07 22:46:17,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:17" (3/3) ... [2025-02-07 22:46:17,745 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal58.c [2025-02-07 22:46:17,756 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:46:17,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal58.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:46:17,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:46:17,796 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;@6304af5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:46:17,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:46:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-07 22:46:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:46:17,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:17,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:46:17,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:46:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:46:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963189178] [2025-02-07 22:46:17,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:17,813 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-07 22:46:17,815 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-07 22:46:17,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:46:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:46:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:17,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:17,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:46:17,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:46:18,061 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-07 22:46:18,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:46:18,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:46:18,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963189178] [2025-02-07 22:46:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963189178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:46:18,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:46:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:46:18,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293048579] [2025-02-07 22:46:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:46:18,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:46:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:46:18,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:46:18,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:46:18,090 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-07 22:46:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:18,136 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:46:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:46:18,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-07 22:46:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:18,144 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:46:18,145 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:46:18,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:46:18,153 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:18,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:46:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:46:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:46:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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-07 22:46:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:46:18,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:46:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:18,182 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:46:18,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-07 22:46:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:46:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:46:18,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:18,184 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:46:18,195 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-07 22:46:18,385 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 [2025-02-07 22:46:18,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:18,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:46:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:46:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117600062] [2025-02-07 22:46:18,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:46:18,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:18,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:18,391 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-07 22:46:18,393 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-07 22:46:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:46:18,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:46:18,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:46:18,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:18,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 22:46:18,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:46:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:18,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:46:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:19,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:46:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117600062] [2025-02-07 22:46:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117600062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:46:19,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:46:19,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:46:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968408123] [2025-02-07 22:46:19,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:46:19,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:46:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:46:19,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:46:19,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:46:19,913 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-07 22:46:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:19,981 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 22:46:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:46:19,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 7 [2025-02-07 22:46:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:19,982 INFO L225 Difference]: With dead ends: 13 [2025-02-07 22:46:19,982 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 22:46:19,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:46:19,983 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:19,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:46:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 22:46:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 22:46:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 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-07 22:46:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 22:46:19,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 22:46:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:19,986 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 22:46:19,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-07 22:46:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 22:46:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 22:46:19,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:19,986 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 22:46:19,993 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-07 22:46:20,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:20,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:20,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 22:46:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:46:20,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796672232] [2025-02-07 22:46:20,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:46:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:20,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:46:20,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 22:46:20,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 22:46:20,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 22:46:20,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:46:20,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:20,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 22:46:20,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:46:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:21,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:46:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:39,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:46:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796672232] [2025-02-07 22:46:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796672232] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:46:39,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:46:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 22:46:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571667053] [2025-02-07 22:46:39,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:46:39,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:46:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:46:39,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:46:39,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:46:39,306 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-07 22:46:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:39,470 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-07 22:46:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:46:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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 10 [2025-02-07 22:46:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:39,471 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:46:39,471 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 22:46:39,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:46:39,475 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:39,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:46:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 22:46:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 22:46:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 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-07 22:46:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 22:46:39,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2025-02-07 22:46:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:39,478 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 22:46:39,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-07 22:46:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 22:46:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:46:39,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:39,478 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 22:46:39,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 22:46:39,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:39,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-02-07 22:46:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:46:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080953749] [2025-02-07 22:46:39,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:46:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:39,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:46:39,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 22:46:39,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-07 22:46:39,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 10 of 13 statements. [2025-02-07 22:46:39,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 22:46:39,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:39,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-07 22:46:39,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:46:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 22:46:40,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:47:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 22:47:00,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:47:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080953749] [2025-02-07 22:47:00,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080953749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:47:00,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:47:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-02-07 22:47:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008284631] [2025-02-07 22:47:00,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:47:00,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 22:47:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:47:00,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 22:47:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:47:00,629 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-07 22:47:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:00,864 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-07 22:47:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:47:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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 13 [2025-02-07 22:47:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:00,864 INFO L225 Difference]: With dead ends: 14 [2025-02-07 22:47:00,864 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 22:47:00,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-07 22:47:00,865 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:00,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:47:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 22:47:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 22:47:00,866 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-07 22:47:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 22:47:00,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2025-02-07 22:47:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:00,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 22:47:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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-07 22:47:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 22:47:00,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 22:47:00,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:47:00,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 22:47:01,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:47:01,076 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-07 22:47:01,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 22:47:01,248 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:47:01,255 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-07 22:47:01,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-07 22:47:01,256 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-07 22:47:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:47:01 BoogieIcfgContainer [2025-02-07 22:47:01,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:47:01,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:47:01,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:47:01,263 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:47:01,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:46:17" (3/4) ... [2025-02-07 22:47:01,265 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 22:47:01,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-07 22:47:01,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-07 22:47:01,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 22:47:01,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 22:47:01,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 22:47:01,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 22:47:01,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 22:47:01,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:47:01,334 INFO L158 Benchmark]: Toolchain (without parser) took 44250.33ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 90.8MB in the beginning and 532.7MB in the end (delta: -441.9MB). Peak memory consumption was 571.4MB. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.03ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 76.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.55ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: Boogie Preprocessor took 48.80ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: IcfgBuilder took 304.50ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 51.8MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 22:47:01,335 INFO L158 Benchmark]: TraceAbstraction took 43523.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 51.2MB in the beginning and 537.6MB in the end (delta: -486.4MB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. [2025-02-07 22:47:01,336 INFO L158 Benchmark]: Witness Printer took 71.35ms. Allocated memory is still 1.1GB. Free memory was 537.6MB in the beginning and 532.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:47:01,336 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.39ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.03ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 76.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.55ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 74.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.80ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 72.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 304.50ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 51.8MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43523.45ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 51.2MB in the beginning and 537.6MB in the end (delta: -486.4MB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. * Witness Printer took 71.35ms. Allocated memory is still 1.1GB. Free memory was 537.6MB in the beginning and 532.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.3s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 11 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 41.4s InterpolantComputationTime, 34 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 27 QuantifiedInterpolants, 64181 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/48 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: 59]: Location Invariant Derived location invariant: ((((((((((0 == var_15) && (0 == var_11)) && (7 == mask_SORT_5)) && (4 == var_21)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == state_18)) && (1 == var_31)) || ((((((((0 == state_18) && (0 == var_15)) && (0 == var_11)) && (7 == mask_SORT_5)) && (4 == var_21)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == var_31))) || ((((((((0 == state_18) && (0 == var_15)) && (0 == state_12)) && (0 == var_11)) && (7 == mask_SORT_5)) && (4 == var_21)) && (1 == mask_SORT_1)) && (1 == var_31))) RESULT: Ultimate proved your program to be correct! [2025-02-07 22:47:01,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE