./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:27:27,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:27:27,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:27:27,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:27:27,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:27:27,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:27:27,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:27:27,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:27:27,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:27:27,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:27:27,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:27:27,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:27:27,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:27:27,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:27:27,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:27:27,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:27:27,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:27:27,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:27:27,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:27:27,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:27:27,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:27:27,107 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/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 -> 6962e7bd484ae8ad671ef131faeb71f366744a10aa5efd4c2cd3298bbb34e994 [2025-03-08 11:27:27,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:27:27,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:27:27,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:27:27,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:27:27,358 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:27:27,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2025-03-08 11:27:28,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75618672/9d1def7e6c61458b83815fefb2f669fc/FLAG60d2abdab [2025-03-08 11:27:28,879 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:27:28,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2025-03-08 11:27:28,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75618672/9d1def7e6c61458b83815fefb2f669fc/FLAG60d2abdab [2025-03-08 11:27:28,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75618672/9d1def7e6c61458b83815fefb2f669fc [2025-03-08 11:27:28,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:27:28,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:27:28,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:27:28,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:27:28,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:27:28,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:27:28" (1/1) ... [2025-03-08 11:27:28,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d491be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:28, skipping insertion in model container [2025-03-08 11:27:28,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:27:28" (1/1) ... [2025-03-08 11:27:28,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:27:29,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2025-03-08 11:27:29,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:27:29,083 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:27:29,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-33.i[915,928] [2025-03-08 11:27:29,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:27:29,132 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:27:29,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29 WrapperNode [2025-03-08 11:27:29,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:27:29,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:27:29,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:27:29,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:27:29,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,190 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2025-03-08 11:27:29,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:27:29,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:27:29,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:27:29,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:27:29,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,223 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-03-08 11:27:29,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:27:29,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:27:29,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:27:29,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:27:29,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (1/1) ... [2025-03-08 11:27:29,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:27:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:27:29,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:27:29,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:27:29,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:27:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:27:29,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:27:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:27:29,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:27:29,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:27:29,374 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:27:29,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:27:29,790 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc property_#t~ite27#1;havoc property_#t~bitwise26#1; [2025-03-08 11:27:29,832 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 11:27:29,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:27:29,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:27:29,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:27:29,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:27:29 BoogieIcfgContainer [2025-03-08 11:27:29,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:27:29,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:27:29,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:27:29,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:27:29,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:27:28" (1/3) ... [2025-03-08 11:27:29,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409111a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:27:29, skipping insertion in model container [2025-03-08 11:27:29,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:27:29" (2/3) ... [2025-03-08 11:27:29,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409111a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:27:29, skipping insertion in model container [2025-03-08 11:27:29,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:27:29" (3/3) ... [2025-03-08 11:27:29,861 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-33.i [2025-03-08 11:27:29,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:27:29,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-33.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:27:29,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:27:29,933 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;@4d8f1498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:27:29,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:27:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 11:27:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 11:27:29,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:29,953 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:29,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:29,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2037136080, now seen corresponding path program 1 times [2025-03-08 11:27:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:29,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368845016] [2025-03-08 11:27:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:30,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 11:27:30,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 11:27:30,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:30,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-08 11:27:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368845016] [2025-03-08 11:27:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368845016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:27:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737685436] [2025-03-08 11:27:30,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:30,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:27:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:27:30,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:27:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:27:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 11:27:30,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 11:27:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:30,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:27:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:27:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-08 11:27:30,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:27:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737685436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:27:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:27:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:27:30,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217538779] [2025-03-08 11:27:30,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:27:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:27:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:27:30,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:27:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:27:30,656 INFO L87 Difference]: Start difference. First operand has 111 states, 66 states have (on average 1.393939393939394) internal successors, (92), 67 states have internal predecessors, (92), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 11:27:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:27:30,699 INFO L93 Difference]: Finished difference Result 214 states and 385 transitions. [2025-03-08 11:27:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:27:30,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 257 [2025-03-08 11:27:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:27:30,709 INFO L225 Difference]: With dead ends: 214 [2025-03-08 11:27:30,709 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 11:27:30,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 258 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-03-08 11:27:30,717 INFO L435 NwaCegarLoop]: 162 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, 162 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-03-08 11:27:30,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:27:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 11:27:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 11:27:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 11:27:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2025-03-08 11:27:30,763 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 257 [2025-03-08 11:27:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:27:30,764 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 164 transitions. [2025-03-08 11:27:30,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 11:27:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions. [2025-03-08 11:27:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-08 11:27:30,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:30,767 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:30,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:27:30,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:27:30,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:30,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2032474030, now seen corresponding path program 1 times [2025-03-08 11:27:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131715317] [2025-03-08 11:27:30,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-08 11:27:31,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-08 11:27:31,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:31,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 11:27:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131715317] [2025-03-08 11:27:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131715317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:27:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:27:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:27:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299037694] [2025-03-08 11:27:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:27:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:27:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:27:31,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:27:31,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:27:31,922 INFO L87 Difference]: Start difference. First operand 106 states and 164 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:27:32,303 INFO L93 Difference]: Finished difference Result 317 states and 494 transitions. [2025-03-08 11:27:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:27:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 257 [2025-03-08 11:27:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:27:32,308 INFO L225 Difference]: With dead ends: 317 [2025-03-08 11:27:32,309 INFO L226 Difference]: Without dead ends: 214 [2025-03-08 11:27:32,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:27:32,310 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 102 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:27:32,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 428 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:27:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-08 11:27:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 200. [2025-03-08 11:27:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 113 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 11:27:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions. [2025-03-08 11:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 257 [2025-03-08 11:27:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:27:32,356 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 313 transitions. [2025-03-08 11:27:32,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2025-03-08 11:27:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 11:27:32,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:32,360 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:27:32,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1136225096, now seen corresponding path program 1 times [2025-03-08 11:27:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614307523] [2025-03-08 11:27:32,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:32,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 11:27:32,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 11:27:32,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:32,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 11:27:32,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614307523] [2025-03-08 11:27:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614307523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:27:32,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:27:32,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:27:32,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722876367] [2025-03-08 11:27:32,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:27:32,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:27:32,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:27:32,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:27:32,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:27:32,660 INFO L87 Difference]: Start difference. First operand 200 states and 313 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:27:32,914 INFO L93 Difference]: Finished difference Result 326 states and 505 transitions. [2025-03-08 11:27:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:27:32,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 258 [2025-03-08 11:27:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:27:32,918 INFO L225 Difference]: With dead ends: 326 [2025-03-08 11:27:32,923 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 11:27:32,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:27:32,925 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:27:32,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 433 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:27:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 11:27:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 201. [2025-03-08 11:27:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 11:27:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions. [2025-03-08 11:27:32,961 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 258 [2025-03-08 11:27:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:27:32,962 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 313 transitions. [2025-03-08 11:27:32,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2025-03-08 11:27:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-08 11:27:32,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:32,965 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:27:32,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash -165363399, now seen corresponding path program 1 times [2025-03-08 11:27:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697854267] [2025-03-08 11:27:32,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:32,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 11:27:33,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 11:27:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 11:27:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697854267] [2025-03-08 11:27:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697854267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:27:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:27:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 11:27:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65620330] [2025-03-08 11:27:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:27:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:27:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:27:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:27:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:27:40,354 INFO L87 Difference]: Start difference. First operand 201 states and 313 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:27:42,790 INFO L93 Difference]: Finished difference Result 494 states and 745 transitions. [2025-03-08 11:27:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:27:42,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 259 [2025-03-08 11:27:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:27:42,795 INFO L225 Difference]: With dead ends: 494 [2025-03-08 11:27:42,795 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 11:27:42,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:27:42,797 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 347 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:27:42,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1403 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:27:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 11:27:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 338. [2025-03-08 11:27:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 207 states have (on average 1.289855072463768) internal successors, (267), 207 states have internal predecessors, (267), 126 states have call successors, (126), 4 states have call predecessors, (126), 4 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 11:27:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 519 transitions. [2025-03-08 11:27:42,884 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 519 transitions. Word has length 259 [2025-03-08 11:27:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:27:42,885 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 519 transitions. [2025-03-08 11:27:42,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 11:27:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 519 transitions. [2025-03-08 11:27:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-08 11:27:42,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:42,887 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:42,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:27:42,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:42,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash -361876904, now seen corresponding path program 1 times [2025-03-08 11:27:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095496677] [2025-03-08 11:27:42,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:42,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 11:27:43,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 11:27:43,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 11:27:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095496677] [2025-03-08 11:27:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095496677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:27:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866539685] [2025-03-08 11:27:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:27:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:27:43,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:27:43,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:27:43,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 11:27:43,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 11:27:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:43,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:43,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:27:43,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:27:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1491 proven. 36 refuted. 0 times theorem prover too weak. 1917 trivial. 0 not checked. [2025-03-08 11:27:43,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:27:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 87 proven. 36 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 11:27:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866539685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:27:43,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:27:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 11:27:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136137999] [2025-03-08 11:27:43,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:27:43,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:27:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:27:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:27:43,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:27:43,791 INFO L87 Difference]: Start difference. First operand 338 states and 519 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-08 11:27:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:27:44,054 INFO L93 Difference]: Finished difference Result 614 states and 926 transitions. [2025-03-08 11:27:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:27:44,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 259 [2025-03-08 11:27:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:27:44,058 INFO L225 Difference]: With dead ends: 614 [2025-03-08 11:27:44,060 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 11:27:44,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:27:44,064 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 219 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:27:44,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 256 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:27:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 11:27:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2025-03-08 11:27:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 216 states have (on average 1.2638888888888888) internal successors, (273), 216 states have internal predecessors, (273), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 11:27:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 525 transitions. [2025-03-08 11:27:44,110 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 525 transitions. Word has length 259 [2025-03-08 11:27:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:27:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 525 transitions. [2025-03-08 11:27:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-08 11:27:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 525 transitions. [2025-03-08 11:27:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 11:27:44,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:27:44,115 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 11:27:44,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:27:44,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:27:44,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:27:44,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:27:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1720899328, now seen corresponding path program 1 times [2025-03-08 11:27:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:27:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596522550] [2025-03-08 11:27:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:27:44,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 11:27:44,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 11:27:44,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:44,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 11:27:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:27:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596522550] [2025-03-08 11:27:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596522550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:27:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758409691] [2025-03-08 11:27:48,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:27:48,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:27:48,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:27:48,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:27:48,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:27:48,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 11:27:48,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 11:27:48,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:27:48,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:27:48,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 11:27:48,331 INFO L279 TraceCheckSpWp]: Computing forward predicates...