./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:11:05,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:11:05,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:11:05,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:11:05,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:11:05,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:11:05,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:11:05,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:11:05,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:11:05,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:11:05,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:11:05,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:11:05,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:11:05,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:11:05,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:11:05,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:05,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:11:05,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2025-02-06 02:11:06,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:11:06,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:11:06,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:11:06,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:11:06,146 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:11:06,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:07,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b803ff687/8dbf83ac20b1478e9ded2ebf929ef5f6/FLAGe8576b32a [2025-02-06 02:11:07,503 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:11:07,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:07,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b803ff687/8dbf83ac20b1478e9ded2ebf929ef5f6/FLAGe8576b32a [2025-02-06 02:11:07,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b803ff687/8dbf83ac20b1478e9ded2ebf929ef5f6 [2025-02-06 02:11:07,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:11:07,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:11:07,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:07,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:11:07,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:11:07,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e5f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07, skipping insertion in model container [2025-02-06 02:11:07,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:11:07,688 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2025-02-06 02:11:07,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:07,723 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:11:07,730 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2025-02-06 02:11:07,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:07,748 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:11:07,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07 WrapperNode [2025-02-06 02:11:07,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:07,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:07,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:11:07,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:11:07,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,774 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-02-06 02:11:07,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:07,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:11:07,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:11:07,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:11:07,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,791 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:11:07,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:11:07,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:11:07,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:11:07,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:11:07,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (1/1) ... [2025-02-06 02:11:07,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:07,824 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-06 02:11:07,827 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-06 02:11:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:11:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:11:07,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:11:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:11:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:11:07,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:11:07,882 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:11:07,883 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:11:08,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: havoc property_#t~bitwise11#1;havoc property_#t~short12#1; [2025-02-06 02:11:08,065 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 02:11:08,065 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:11:08,084 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:11:08,084 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:11:08,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:08 BoogieIcfgContainer [2025-02-06 02:11:08,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:11:08,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:11:08,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:11:08,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:11:08,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:11:07" (1/3) ... [2025-02-06 02:11:08,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e7409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:08, skipping insertion in model container [2025-02-06 02:11:08,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:07" (2/3) ... [2025-02-06 02:11:08,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e7409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:08, skipping insertion in model container [2025-02-06 02:11:08,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:08" (3/3) ... [2025-02-06 02:11:08,093 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:08,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:11:08,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-60.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:11:08,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:11:08,154 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;@cd65045, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:11:08,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:11:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:11:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 02:11:08,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:08,162 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:08,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:08,165 INFO L85 PathProgramCache]: Analyzing trace with hash 437327464, now seen corresponding path program 1 times [2025-02-06 02:11:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:08,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697680763] [2025-02-06 02:11:08,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:08,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 02:11:08,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 02:11:08,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:08,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 02:11:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697680763] [2025-02-06 02:11:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697680763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:11:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033661850] [2025-02-06 02:11:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:11:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:08,350 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-06 02:11:08,352 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-06 02:11:08,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 02:11:08,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 02:11:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:08,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:11:08,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 02:11:08,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:11:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033661850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:11:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:11:08,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736570070] [2025-02-06 02:11:08,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:08,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:11:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:08,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:11:08,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:08,478 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 02:11:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:08,495 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2025-02-06 02:11:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:11:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-02-06 02:11:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:08,501 INFO L225 Difference]: With dead ends: 94 [2025-02-06 02:11:08,501 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 02:11:08,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:08,505 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 02:11:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 02:11:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:11:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-02-06 02:11:08,529 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2025-02-06 02:11:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-02-06 02:11:08,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 02:11:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-02-06 02:11:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 02:11:08,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:08,531 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:08,538 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-06 02:11:08,732 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,SelfDestructingSolverStorable0 [2025-02-06 02:11:08,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2129101416, now seen corresponding path program 1 times [2025-02-06 02:11:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834609233] [2025-02-06 02:11:08,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:08,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 02:11:08,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 02:11:08,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:08,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834609233] [2025-02-06 02:11:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834609233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:09,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:11:09,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367519477] [2025-02-06 02:11:09,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:09,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:11:09,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:09,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:11:09,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:11:09,398 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:09,590 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2025-02-06 02:11:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:11:09,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-02-06 02:11:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:09,592 INFO L225 Difference]: With dead ends: 112 [2025-02-06 02:11:09,592 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 02:11:09,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:11:09,593 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:09,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 248 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:11:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 02:11:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2025-02-06 02:11:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:11:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2025-02-06 02:11:09,599 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 81 [2025-02-06 02:11:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2025-02-06 02:11:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2025-02-06 02:11:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 02:11:09,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:09,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:11:09,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:09,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1932587911, now seen corresponding path program 1 times [2025-02-06 02:11:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14700417] [2025-02-06 02:11:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:09,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 02:11:09,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 02:11:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14700417] [2025-02-06 02:11:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14700417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:11:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958310856] [2025-02-06 02:11:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:11:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:11:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:09,678 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:09,714 INFO L93 Difference]: Finished difference Result 151 states and 211 transitions. [2025-02-06 02:11:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:11:09,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2025-02-06 02:11:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:09,719 INFO L225 Difference]: With dead ends: 151 [2025-02-06 02:11:09,719 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 02:11:09,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:09,720 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 35 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:09,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 02:11:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-06 02:11:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 02:11:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-02-06 02:11:09,745 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 81 [2025-02-06 02:11:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:09,745 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-02-06 02:11:09,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-02-06 02:11:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 02:11:09,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:09,749 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:11:09,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 835628646, now seen corresponding path program 1 times [2025-02-06 02:11:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838447200] [2025-02-06 02:11:09,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:09,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 02:11:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 02:11:09,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:09,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:10,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838447200] [2025-02-06 02:11:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838447200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:10,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:10,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:11:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139774731] [2025-02-06 02:11:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:11:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:10,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:11:10,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:11:10,658 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:11,468 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2025-02-06 02:11:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:11:11,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-02-06 02:11:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:11,471 INFO L225 Difference]: With dead ends: 153 [2025-02-06 02:11:11,471 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 02:11:11,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:11:11,472 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:11,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 521 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:11:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 02:11:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2025-02-06 02:11:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 98 states have internal predecessors, (118), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 02:11:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2025-02-06 02:11:11,501 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 83 [2025-02-06 02:11:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2025-02-06 02:11:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2025-02-06 02:11:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 02:11:11,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:11,503 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:11,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:11:11,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash -971825817, now seen corresponding path program 1 times [2025-02-06 02:11:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907948474] [2025-02-06 02:11:11,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:11,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 02:11:11,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 02:11:11,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:11,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907948474] [2025-02-06 02:11:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907948474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:11:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315031990] [2025-02-06 02:11:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:11:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:12,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:11:12,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:11:12,046 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:12,711 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2025-02-06 02:11:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 02:11:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-02-06 02:11:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:12,715 INFO L225 Difference]: With dead ends: 168 [2025-02-06 02:11:12,715 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 02:11:12,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:11:12,721 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 85 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:12,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 578 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:11:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 02:11:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2025-02-06 02:11:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 100 states have (on average 1.22) internal successors, (122), 101 states have internal predecessors, (122), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 02:11:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2025-02-06 02:11:12,759 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 83 [2025-02-06 02:11:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:12,760 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2025-02-06 02:11:12,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2025-02-06 02:11:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 02:11:12,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:12,761 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:11:12,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:12,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash 69291177, now seen corresponding path program 1 times [2025-02-06 02:11:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108762067] [2025-02-06 02:11:12,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:12,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 02:11:12,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 02:11:12,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:12,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108762067] [2025-02-06 02:11:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108762067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:12,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:12,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:11:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284388999] [2025-02-06 02:11:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:12,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:11:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:12,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:11:12,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:12,800 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:12,838 INFO L93 Difference]: Finished difference Result 280 states and 382 transitions. [2025-02-06 02:11:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:11:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2025-02-06 02:11:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:12,842 INFO L225 Difference]: With dead ends: 280 [2025-02-06 02:11:12,842 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 02:11:12,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:12,844 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:12,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 116 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 02:11:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2025-02-06 02:11:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 135 states have (on average 1.1851851851851851) internal successors, (160), 137 states have internal predecessors, (160), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:11:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 256 transitions. [2025-02-06 02:11:12,872 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 256 transitions. Word has length 84 [2025-02-06 02:11:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:12,872 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 256 transitions. [2025-02-06 02:11:12,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 256 transitions. [2025-02-06 02:11:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 02:11:12,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:12,873 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:12,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:11:12,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1914002371, now seen corresponding path program 1 times [2025-02-06 02:11:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530039576] [2025-02-06 02:11:12,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:12,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 02:11:12,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 02:11:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530039576] [2025-02-06 02:11:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530039576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:11:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464259712] [2025-02-06 02:11:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:11:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:12,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:11:12,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:12,906 INFO L87 Difference]: Start difference. First operand 189 states and 256 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:12,945 INFO L93 Difference]: Finished difference Result 328 states and 445 transitions. [2025-02-06 02:11:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:11:12,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2025-02-06 02:11:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:12,946 INFO L225 Difference]: With dead ends: 328 [2025-02-06 02:11:12,946 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 02:11:12,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:12,947 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:12,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 02:11:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2025-02-06 02:11:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.16) internal successors, (145), 127 states have internal predecessors, (145), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:11:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 241 transitions. [2025-02-06 02:11:12,966 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 241 transitions. Word has length 84 [2025-02-06 02:11:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:12,967 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 241 transitions. [2025-02-06 02:11:12,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 241 transitions. [2025-02-06 02:11:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 02:11:12,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:12,968 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:12,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:11:12,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:12,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1506712788, now seen corresponding path program 1 times [2025-02-06 02:11:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49349300] [2025-02-06 02:11:12,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:12,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 02:11:12,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 02:11:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49349300] [2025-02-06 02:11:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49349300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:11:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673301475] [2025-02-06 02:11:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:11:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:13,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:11:13,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:11:13,114 INFO L87 Difference]: Start difference. First operand 179 states and 241 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:13,169 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2025-02-06 02:11:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:11:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2025-02-06 02:11:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:13,173 INFO L225 Difference]: With dead ends: 357 [2025-02-06 02:11:13,173 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 02:11:13,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:11:13,174 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 21 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:13,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 02:11:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-02-06 02:11:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.136) internal successors, (142), 127 states have internal predecessors, (142), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 02:11:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 238 transitions. [2025-02-06 02:11:13,191 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 238 transitions. Word has length 84 [2025-02-06 02:11:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:13,191 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 238 transitions. [2025-02-06 02:11:13,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 238 transitions. [2025-02-06 02:11:13,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 02:11:13,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:13,192 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:11:13,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:13,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -171109183, now seen corresponding path program 1 times [2025-02-06 02:11:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522550381] [2025-02-06 02:11:13,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:13,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 02:11:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 02:11:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522550381] [2025-02-06 02:11:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522550381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:11:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464200704] [2025-02-06 02:11:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:13,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:11:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:13,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:11:13,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:11:13,283 INFO L87 Difference]: Start difference. First operand 179 states and 238 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:13,347 INFO L93 Difference]: Finished difference Result 312 states and 407 transitions. [2025-02-06 02:11:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:11:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2025-02-06 02:11:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:13,350 INFO L225 Difference]: With dead ends: 312 [2025-02-06 02:11:13,350 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 02:11:13,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:11:13,351 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:13,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 379 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 02:11:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2025-02-06 02:11:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 212 states have (on average 1.0896226415094339) internal successors, (231), 219 states have internal predecessors, (231), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 02:11:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 399 transitions. [2025-02-06 02:11:13,407 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 399 transitions. Word has length 85 [2025-02-06 02:11:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:13,407 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 399 transitions. [2025-02-06 02:11:13,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 399 transitions. [2025-02-06 02:11:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 02:11:13,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:13,408 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:13,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:11:13,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:13,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -367622688, now seen corresponding path program 1 times [2025-02-06 02:11:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:13,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270891665] [2025-02-06 02:11:13,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:13,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 02:11:13,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 02:11:13,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:13,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270891665] [2025-02-06 02:11:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270891665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:11:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265025549] [2025-02-06 02:11:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:13,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:11:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:13,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:11:13,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:11:13,553 INFO L87 Difference]: Start difference. First operand 307 states and 399 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:13,713 INFO L93 Difference]: Finished difference Result 590 states and 769 transitions. [2025-02-06 02:11:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:11:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2025-02-06 02:11:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:13,715 INFO L225 Difference]: With dead ends: 590 [2025-02-06 02:11:13,715 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 02:11:13,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:11:13,716 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:13,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 522 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:11:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 02:11:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 317. [2025-02-06 02:11:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 222 states have (on average 1.0945945945945945) internal successors, (243), 229 states have internal predecessors, (243), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 02:11:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 411 transitions. [2025-02-06 02:11:13,745 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 411 transitions. Word has length 85 [2025-02-06 02:11:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 411 transitions. [2025-02-06 02:11:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 411 transitions. [2025-02-06 02:11:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 02:11:13,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:13,747 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:13,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:11:13,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1631144288, now seen corresponding path program 1 times [2025-02-06 02:11:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210545201] [2025-02-06 02:11:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 02:11:13,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 02:11:13,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:13,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 02:11:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:11:13,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210545201] [2025-02-06 02:11:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210545201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:11:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103868472] [2025-02-06 02:11:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:13,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:11:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:11:13,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:11:13,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:13,798 INFO L87 Difference]: Start difference. First operand 317 states and 411 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:13,934 INFO L93 Difference]: Finished difference Result 643 states and 836 transitions. [2025-02-06 02:11:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:11:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-02-06 02:11:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:13,943 INFO L225 Difference]: With dead ends: 643 [2025-02-06 02:11:13,943 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 02:11:13,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:11:13,945 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:13,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:11:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 02:11:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 329. [2025-02-06 02:11:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 226 states have (on average 1.075221238938053) internal successors, (243), 234 states have internal predecessors, (243), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 82 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:11:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 423 transitions. [2025-02-06 02:11:14,068 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 423 transitions. Word has length 87 [2025-02-06 02:11:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 423 transitions. [2025-02-06 02:11:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 02:11:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 423 transitions. [2025-02-06 02:11:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 02:11:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:14,072 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:11:14,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -770473228, now seen corresponding path program 1 times [2025-02-06 02:11:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:11:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223752864] [2025-02-06 02:11:14,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:11:14,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 02:11:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 02:11:14,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:11:14,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:11:14,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 02:11:14,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 02:11:14,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:11:14,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:11:14,194 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:11:14,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:11:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:11:14,198 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:11:14,246 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:11:14,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:11:14 BoogieIcfgContainer [2025-02-06 02:11:14,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:11:14,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:11:14,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:11:14,248 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:11:14,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:08" (3/4) ... [2025-02-06 02:11:14,251 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:11:14,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:11:14,253 INFO L158 Benchmark]: Toolchain (without parser) took 6692.74ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 111.5MB in the beginning and 229.8MB in the end (delta: -118.3MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,253 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:11:14,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.73ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 100.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:11:14,254 INFO L158 Benchmark]: Boogie Preprocessor took 22.29ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,254 INFO L158 Benchmark]: IcfgBuilder took 287.43ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 80.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,254 INFO L158 Benchmark]: TraceAbstraction took 6161.77ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 80.6MB in the beginning and 229.9MB in the end (delta: -149.3MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,254 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 343.9MB. Free memory was 229.9MB in the beginning and 229.8MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:11:14,255 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.73ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 100.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.29ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 287.43ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 80.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6161.77ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 80.6MB in the beginning and 229.9MB in the end (delta: -149.3MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 343.9MB. Free memory was 229.9MB in the beginning and 229.8MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 37, overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] signed char var_1_5 = 4; [L27] signed char var_1_6 = -5; [L28] signed char var_1_7 = 2; [L29] signed char var_1_8 = -32; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L68] isInitial = 1 [L69] FCALL initially() [L70] COND TRUE 1 [L71] FCALL updateLastVariables() [L72] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_uchar() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L44] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L45] var_1_3 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L47] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=4, var_1_6=-5, var_1_7=2, var_1_8=-32] [L51] var_1_5 = __VERIFIER_nondet_char() [L52] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L52] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L53] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=-5, var_1_7=2, var_1_8=-32] [L54] var_1_6 = __VERIFIER_nondet_char() [L55] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L55] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L56] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=2, var_1_8=-32] [L57] var_1_7 = __VERIFIER_nondet_char() [L58] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L58] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L59] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L59] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L72] RET updateVariables() [L73] CALL step() [L33] COND TRUE (var_1_2 || var_1_3) && var_1_4 [L34] var_1_1 = (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L36] signed char stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=-1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L37] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, stepLocal_0=-1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L37] COND FALSE !(stepLocal_0 > ((-100 + var_1_1) ^ var_1_1)) [L73] RET step() [L74] CALL, EXPR property() [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L64] EXPR (-100 + var_1_1) ^ var_1_1 VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L64] EXPR (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L64-L65] return (((var_1_2 || var_1_3) && var_1_4) ? (var_1_1 == ((signed char) (((((var_1_5 + var_1_6)) < (var_1_7)) ? ((var_1_5 + var_1_6)) : (var_1_7))))) : 1) && ((var_1_5 > ((-100 + var_1_1) ^ var_1_1)) ? (var_1_8 == ((signed char) var_1_6)) : 1) ; [L74] RET, EXPR property() [L74] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] [L19] reach_error() VAL [isInitial=1, var_1_1=62, var_1_2=1, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=63, var_1_8=-32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 3093 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2260 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 833 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=11, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 188 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 2533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 3146/3168 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-06 02:11:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:11:16,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:11:16,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:11:16,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:11:16,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:11:16,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:11:16,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:11:16,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:11:16,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:11:16,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:11:16,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:11:16,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:11:16,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:11:16,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:11:16,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:11:16,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:11:16,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:16,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:11:16,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1357d444372cb240879d52665bbb1bc7c8a774ef50fd6fb938c499d379831d6 [2025-02-06 02:11:16,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:11:16,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:11:16,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:11:16,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:11:16,638 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:11:16,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:17,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/289c4f6fa/00358fe68e8643748545d0d5b3db68e3/FLAG40163f80d [2025-02-06 02:11:17,985 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:11:17,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:17,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/289c4f6fa/00358fe68e8643748545d0d5b3db68e3/FLAG40163f80d [2025-02-06 02:11:18,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/289c4f6fa/00358fe68e8643748545d0d5b3db68e3 [2025-02-06 02:11:18,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:11:18,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:11:18,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:18,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:11:18,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:11:18,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd1b5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18, skipping insertion in model container [2025-02-06 02:11:18,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:11:18,120 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2025-02-06 02:11:18,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:18,158 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:11:18,166 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/hardness-nfm22/hardness_operatoramount_amount10_file-60.i[915,928] [2025-02-06 02:11:18,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:11:18,183 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:11:18,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18 WrapperNode [2025-02-06 02:11:18,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:11:18,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:18,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:11:18,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:11:18,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,210 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2025-02-06 02:11:18,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:11:18,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:11:18,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:11:18,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:11:18,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,234 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:11:18,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:11:18,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:11:18,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:11:18,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:11:18,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (1/1) ... [2025-02-06 02:11:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:11:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:18,283 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-06 02:11:18,292 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-06 02:11:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:11:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:11:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:11:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:11:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:11:18,364 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:11:18,366 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:11:18,518 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-06 02:11:18,518 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:11:18,524 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:11:18,525 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:11:18,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:18 BoogieIcfgContainer [2025-02-06 02:11:18,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:11:18,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:11:18,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:11:18,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:11:18,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:11:18" (1/3) ... [2025-02-06 02:11:18,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:18, skipping insertion in model container [2025-02-06 02:11:18,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:11:18" (2/3) ... [2025-02-06 02:11:18,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657dc95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:11:18, skipping insertion in model container [2025-02-06 02:11:18,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:11:18" (3/3) ... [2025-02-06 02:11:18,534 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-60.i [2025-02-06 02:11:18,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:11:18,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-60.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:11:18,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:11:18,597 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;@1d9b0551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:11:18,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:11:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:11:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 02:11:18,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:18,608 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:18,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:18,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1486558192, now seen corresponding path program 1 times [2025-02-06 02:11:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517990584] [2025-02-06 02:11:18,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:11:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:18,626 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-06 02:11:18,631 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-06 02:11:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 02:11:18,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 02:11:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:18,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:11:18,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 02:11:18,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:11:18,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:11:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517990584] [2025-02-06 02:11:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517990584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:11:18,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:11:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:11:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779250601] [2025-02-06 02:11:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:11:18,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:11:18,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:11:18,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:11:18,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:18,796 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 02:11:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:11:18,813 INFO L93 Difference]: Finished difference Result 72 states and 115 transitions. [2025-02-06 02:11:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:11:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2025-02-06 02:11:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:11:18,818 INFO L225 Difference]: With dead ends: 72 [2025-02-06 02:11:18,818 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 02:11:18,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:11:18,823 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:11:18,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:11:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 02:11:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 02:11:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 02:11:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-02-06 02:11:18,854 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 78 [2025-02-06 02:11:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:11:18,854 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-02-06 02:11:18,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 02:11:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-02-06 02:11:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 02:11:18,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:11:18,857 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:11:18,865 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-06 02:11:19,062 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-06 02:11:19,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:11:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:11:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1388566544, now seen corresponding path program 1 times [2025-02-06 02:11:19,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:11:19,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [16540870] [2025-02-06 02:11:19,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:11:19,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:11:19,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:11:19,067 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-06 02:11:19,068 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-06 02:11:19,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 02:11:19,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 02:11:19,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:11:19,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:11:19,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:11:19,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:11:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 02:11:20,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:12:16,854 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-06 02:12:16,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:12:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16540870] [2025-02-06 02:12:16,855 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-06 02:12:16,856 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 101 [2025-02-06 02:12:16,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:12:17,057 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-06 02:12:17,058 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-06 02:12:17,070 INFO L158 Benchmark]: Toolchain (without parser) took 59058.14ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 92.2MB in the beginning and 197.0MB in the end (delta: -104.8MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:17,070 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:17,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.77ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:17,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.01ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:17,071 INFO L158 Benchmark]: Boogie Preprocessor took 38.80ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:12:17,071 INFO L158 Benchmark]: IcfgBuilder took 275.35ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:12:17,071 INFO L158 Benchmark]: TraceAbstraction took 58538.61ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 63.2MB in the beginning and 197.0MB in the end (delta: -133.8MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2025-02-06 02:12:17,074 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.22ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.77ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 79.8MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.01ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.80ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 275.35ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 63.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 58538.61ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 63.2MB in the beginning and 197.0MB in the end (delta: -133.8MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")