./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-10_file-9.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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:00:42,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:00:43,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:00:43,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:00:43,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:00:43,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:00:43,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:00:43,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:00:43,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:00:43,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:00:43,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:00:43,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:00:43,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:00:43,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:00:43,192 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:00:43,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:00:43,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:00:43,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:00:43,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:00:43,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:00:43,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:00:43,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:00:43,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:00:43,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:00:43,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:00:43,198 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2025-03-17 00:00:43,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:00:43,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:00:43,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:00:43,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:00:43,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:00:43,710 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-10_file-9.i [2025-03-17 00:00:45,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526274e05/c10ee31145f6467baf5a6d8b18023a98/FLAGbc99181c2 [2025-03-17 00:00:46,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:00:46,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2025-03-17 00:00:46,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526274e05/c10ee31145f6467baf5a6d8b18023a98/FLAGbc99181c2 [2025-03-17 00:00:46,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526274e05/c10ee31145f6467baf5a6d8b18023a98 [2025-03-17 00:00:46,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:00:46,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:00:46,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:00:46,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:00:46,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:00:46,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a659079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46, skipping insertion in model container [2025-03-17 00:00:46,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:00:46,518 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-10_file-9.i[914,927] [2025-03-17 00:00:46,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:00:46,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:00:46,676 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-10_file-9.i[914,927] [2025-03-17 00:00:46,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:00:46,769 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:00:46,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46 WrapperNode [2025-03-17 00:00:46,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:00:46,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:00:46,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:00:46,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:00:46,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,855 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2025-03-17 00:00:46,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:00:46,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:00:46,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:00:46,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:00:46,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,895 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-17 00:00:46,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:00:46,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:00:46,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:00:46,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:00:46,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (1/1) ... [2025-03-17 00:00:46,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:00:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:00:46,977 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-17 00:00:46,997 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-17 00:00:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:00:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:00:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:00:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:00:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:00:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:00:47,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:00:47,123 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:00:47,705 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-17 00:00:47,769 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 00:00:47,772 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:00:47,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:00:47,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:00:47,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:47 BoogieIcfgContainer [2025-03-17 00:00:47,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:00:47,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:00:47,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:00:47,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:00:47,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:00:46" (1/3) ... [2025-03-17 00:00:47,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e004d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:47, skipping insertion in model container [2025-03-17 00:00:47,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:00:46" (2/3) ... [2025-03-17 00:00:47,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e004d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:00:47, skipping insertion in model container [2025-03-17 00:00:47,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:47" (3/3) ... [2025-03-17 00:00:47,828 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2025-03-17 00:00:47,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:00:47,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:00:47,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:00:47,955 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;@16294547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:00:47,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:00:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:00:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 00:00:47,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:47,986 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:00:47,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:47,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2100200682, now seen corresponding path program 1 times [2025-03-17 00:00:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-03-17 00:00:48,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 00:00:48,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 00:00:48,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:48,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 00:00:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:48,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625427004] [2025-03-17 00:00:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625427004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:00:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258402214] [2025-03-17 00:00:48,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:48,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:00:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:00:48,487 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-17 00:00:48,489 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-17 00:00:48,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 00:00:48,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 00:00:48,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:48,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:48,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:00:48,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:00:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 00:00:48,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:00:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258402214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:00:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:00:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312837730] [2025-03-17 00:00:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:00:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:00:48,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:00:48,836 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:00:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:48,888 INFO L93 Difference]: Finished difference Result 173 states and 292 transitions. [2025-03-17 00:00:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:00:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-03-17 00:00:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:48,902 INFO L225 Difference]: With dead ends: 173 [2025-03-17 00:00:48,904 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 00:00:48,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-17 00:00:48,915 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:48,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:00:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 00:00:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 00:00:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:00:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2025-03-17 00:00:48,989 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 168 [2025-03-17 00:00:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:48,990 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2025-03-17 00:00:48,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:00:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2025-03-17 00:00:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-17 00:00:48,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:48,999 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:00:49,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:00:49,200 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-17 00:00:49,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:49,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -179359154, now seen corresponding path program 1 times [2025-03-17 00:00:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:49,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501267730] [2025-03-17 00:00:49,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-17 00:00:49,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-17 00:00:49,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:49,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:00:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501267730] [2025-03-17 00:00:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501267730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:00:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481060165] [2025-03-17 00:00:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:49,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:00:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:49,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:00:49,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:00:49,744 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:00:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:49,796 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2025-03-17 00:00:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:00:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-17 00:00:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:49,814 INFO L225 Difference]: With dead ends: 172 [2025-03-17 00:00:49,814 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 00:00:49,815 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-03-17 00:00:49,815 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:49,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:00:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 00:00:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 00:00:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:00:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2025-03-17 00:00:49,842 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 168 [2025-03-17 00:00:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:49,843 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2025-03-17 00:00:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:00:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2025-03-17 00:00:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:00:49,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:49,847 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:00:49,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:00:49,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2139538806, now seen corresponding path program 1 times [2025-03-17 00:00:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392123391] [2025-03-17 00:00:49,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:49,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:00:50,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:00:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:50,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:00:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392123391] [2025-03-17 00:00:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392123391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:00:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418823867] [2025-03-17 00:00:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:00:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:00:52,683 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-17 00:00:52,687 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-17 00:00:52,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:00:52,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:00:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:52,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:00:52,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:00:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 361 proven. 75 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-03-17 00:00:53,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:00:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:00:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418823867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:00:53,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:00:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2025-03-17 00:00:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754886961] [2025-03-17 00:00:53,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:00:53,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 00:00:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 00:00:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:00:53,720 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) [2025-03-17 00:00:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:55,512 INFO L93 Difference]: Finished difference Result 221 states and 323 transitions. [2025-03-17 00:00:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:00:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) Word has length 169 [2025-03-17 00:00:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:55,516 INFO L225 Difference]: With dead ends: 221 [2025-03-17 00:00:55,517 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 00:00:55,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2025-03-17 00:00:55,519 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 402 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:55,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 319 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:00:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 00:00:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2025-03-17 00:00:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:00:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2025-03-17 00:00:55,541 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 169 [2025-03-17 00:00:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2025-03-17 00:00:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) [2025-03-17 00:00:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2025-03-17 00:00:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:00:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:55,544 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:00:55,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:00:55,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 00:00:55,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1629004629, now seen corresponding path program 1 times [2025-03-17 00:00:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854374783] [2025-03-17 00:00:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:55,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:00:55,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:00:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:00:58,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854374783] [2025-03-17 00:00:58,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854374783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:00:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112929095] [2025-03-17 00:00:58,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:58,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:00:58,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:00:58,084 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-17 00:00:58,087 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-17 00:00:58,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:00:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:00:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:58,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 00:00:58,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:00:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-17 00:00:58,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:00:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:00:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112929095] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:00:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:00:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-17 00:00:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055899411] [2025-03-17 00:00:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:00:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:59,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:00:59,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:00:59,907 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:02,072 INFO L93 Difference]: Finished difference Result 362 states and 513 transitions. [2025-03-17 00:01:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:01:02,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:02,075 INFO L225 Difference]: With dead ends: 362 [2025-03-17 00:01:02,075 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 00:01:02,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-17 00:01:02,076 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 393 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:02,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 577 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:01:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 00:01:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 119. [2025-03-17 00:01:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-17 00:01:02,092 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 169 [2025-03-17 00:01:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:02,093 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-17 00:01:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-17 00:01:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:02,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:02,106 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:02,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:01:02,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:02,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash 216859617, now seen corresponding path program 1 times [2025-03-17 00:01:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993900987] [2025-03-17 00:01:02,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:02,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:02,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993900987] [2025-03-17 00:01:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993900987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:04,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738201065] [2025-03-17 00:01:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:04,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:04,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:04,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:04,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:01:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:04,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:04,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 00:01:04,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-17 00:01:05,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738201065] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:01:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 20 [2025-03-17 00:01:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251970171] [2025-03-17 00:01:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:06,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:06,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:01:06,254 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:08,174 INFO L93 Difference]: Finished difference Result 390 states and 555 transitions. [2025-03-17 00:01:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:01:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:08,179 INFO L225 Difference]: With dead ends: 390 [2025-03-17 00:01:08,179 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 00:01:08,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:01:08,184 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 313 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:08,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 645 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:01:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 00:01:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 121. [2025-03-17 00:01:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2025-03-17 00:01:08,215 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 169 [2025-03-17 00:01:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2025-03-17 00:01:08,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2025-03-17 00:01:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:08,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:08,222 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:08,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 00:01:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:08,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 784532758, now seen corresponding path program 1 times [2025-03-17 00:01:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-03-17 00:01:08,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:08,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:08,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:08,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-03-17 00:01:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948701921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63858047] [2025-03-17 00:01:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:11,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:11,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:11,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:11,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:01:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:11,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:11,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:11,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 00:01:11,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 477 proven. 234 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-03-17 00:01:12,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63858047] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:01:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 20] total 30 [2025-03-17 00:01:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707456317] [2025-03-17 00:01:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:13,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:13,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:01:13,883 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:16,247 INFO L93 Difference]: Finished difference Result 395 states and 561 transitions. [2025-03-17 00:01:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:01:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:16,250 INFO L225 Difference]: With dead ends: 395 [2025-03-17 00:01:16,250 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 00:01:16,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 00:01:16,251 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 267 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:16,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 617 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:01:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 00:01:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 122. [2025-03-17 00:01:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-03-17 00:01:16,271 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 169 [2025-03-17 00:01:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:16,271 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-03-17 00:01:16,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-03-17 00:01:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:16,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:16,274 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:16,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 00:01:16,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:16,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash -627612254, now seen corresponding path program 1 times [2025-03-17 00:01:16,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:16,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-03-17 00:01:16,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:16,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:16,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:16,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:16,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-03-17 00:01:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949203763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054840998] [2025-03-17 00:01:18,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:18,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:18,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 00:01:18,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:18,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:01:18,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:18,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:01:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054840998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:01:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-17 00:01:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367407066] [2025-03-17 00:01:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:18,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:01:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:18,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:01:18,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:01:18,998 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:19,263 INFO L93 Difference]: Finished difference Result 331 states and 472 transitions. [2025-03-17 00:01:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:01:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:19,267 INFO L225 Difference]: With dead ends: 331 [2025-03-17 00:01:19,267 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 00:01:19,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:01:19,268 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 106 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:19,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 633 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:01:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 00:01:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 121. [2025-03-17 00:01:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2025-03-17 00:01:19,294 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 169 [2025-03-17 00:01:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:19,295 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2025-03-17 00:01:19,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2025-03-17 00:01:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:19,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:19,301 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:19,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 00:01:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:19,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1840355542, now seen corresponding path program 1 times [2025-03-17 00:01:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040811087] [2025-03-17 00:01:19,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:19,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:19,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:19,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:20,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:20,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040811087] [2025-03-17 00:01:20,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040811087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:20,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150920056] [2025-03-17 00:01:20,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:20,693 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:20,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 00:01:20,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:20,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:20,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 00:01:20,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-17 00:01:21,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150920056] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:21,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:01:21,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2025-03-17 00:01:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652911044] [2025-03-17 00:01:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:21,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:21,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:21,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:01:21,795 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:22,903 INFO L93 Difference]: Finished difference Result 377 states and 538 transitions. [2025-03-17 00:01:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:01:22,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:22,908 INFO L225 Difference]: With dead ends: 377 [2025-03-17 00:01:22,908 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 00:01:22,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2025-03-17 00:01:22,909 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 248 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:22,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 723 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 00:01:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 00:01:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 122. [2025-03-17 00:01:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-03-17 00:01:22,935 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 169 [2025-03-17 00:01:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:22,935 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-03-17 00:01:22,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-03-17 00:01:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:22,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:22,940 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:22,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 00:01:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:23,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 428210530, now seen corresponding path program 1 times [2025-03-17 00:01:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501023616] [2025-03-17 00:01:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:23,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:23,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:23,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:23,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:24,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:24,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501023616] [2025-03-17 00:01:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501023616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516031246] [2025-03-17 00:01:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:24,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:24,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 00:01:24,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:24,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:24,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 00:01:24,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-17 00:01:24,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516031246] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:01:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 20 [2025-03-17 00:01:25,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134214200] [2025-03-17 00:01:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:25,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:25,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:01:25,326 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:26,348 INFO L93 Difference]: Finished difference Result 382 states and 546 transitions. [2025-03-17 00:01:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:01:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 00:01:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:26,353 INFO L225 Difference]: With dead ends: 382 [2025-03-17 00:01:26,353 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 00:01:26,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:01:26,354 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 235 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:26,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 723 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:01:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 00:01:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 121. [2025-03-17 00:01:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2025-03-17 00:01:26,380 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 169 [2025-03-17 00:01:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:26,380 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2025-03-17 00:01:26,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2025-03-17 00:01:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 00:01:26,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:26,381 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:26,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 00:01:26,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 00:01:26,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:26,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 995883671, now seen corresponding path program 1 times [2025-03-17 00:01:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28008119] [2025-03-17 00:01:26,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:26,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:26,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:27,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28008119] [2025-03-17 00:01:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28008119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:01:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222373823] [2025-03-17 00:01:27,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:27,424 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:27,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 00:01:27,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 00:01:27,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 00:01:27,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:27,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:27,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 00:01:27,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 514 proven. 108 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-03-17 00:01:28,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 36 proven. 111 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2025-03-17 00:01:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222373823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:01:28,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:01:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-17 00:01:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703582779] [2025-03-17 00:01:28,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:01:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 00:01:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:28,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 00:01:28,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-03-17 00:01:28,559 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 7 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 7 states have call predecessors, (78), 7 states have call successors, (78) [2025-03-17 00:01:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:31,539 INFO L93 Difference]: Finished difference Result 460 states and 647 transitions. [2025-03-17 00:01:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 00:01:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 7 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 7 states have call predecessors, (78), 7 states have call successors, (78) Word has length 169 [2025-03-17 00:01:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:31,543 INFO L225 Difference]: With dead ends: 460 [2025-03-17 00:01:31,543 INFO L226 Difference]: Without dead ends: 340 [2025-03-17 00:01:31,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=614, Invalid=2578, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 00:01:31,554 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 740 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:31,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1427 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 00:01:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-17 00:01:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 201. [2025-03-17 00:01:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 00:01:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 281 transitions. [2025-03-17 00:01:31,630 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 281 transitions. Word has length 169 [2025-03-17 00:01:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:31,634 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 281 transitions. [2025-03-17 00:01:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 7 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 7 states have call predecessors, (78), 7 states have call successors, (78) [2025-03-17 00:01:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 281 transitions. [2025-03-17 00:01:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:01:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:31,636 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 00:01:31,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 00:01:31,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1278953395, now seen corresponding path program 1 times [2025-03-17 00:01:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045524103] [2025-03-17 00:01:31,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:31,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:01:31,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:01:31,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:31,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:01:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822623609] [2025-03-17 00:01:31,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:31,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:31,979 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:31,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 00:01:32,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:01:32,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:01:32,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:32,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:32,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:01:32,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 369 proven. 63 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2025-03-17 00:01:32,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:01:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 00:01:32,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045524103] [2025-03-17 00:01:32,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:01:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822623609] [2025-03-17 00:01:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822623609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:01:32,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 00:01:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-17 00:01:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781107612] [2025-03-17 00:01:32,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 00:01:32,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:01:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:32,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:01:32,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:01:32,809 INFO L87 Difference]: Start difference. First operand 201 states and 281 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-03-17 00:01:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:34,164 INFO L93 Difference]: Finished difference Result 577 states and 781 transitions. [2025-03-17 00:01:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 00:01:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 171 [2025-03-17 00:01:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:34,170 INFO L225 Difference]: With dead ends: 577 [2025-03-17 00:01:34,171 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 00:01:34,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:01:34,174 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 204 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:34,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 642 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:01:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 00:01:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 279. [2025-03-17 00:01:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 216 states have (on average 1.3009259259259258) internal successors, (281), 216 states have internal predecessors, (281), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 00:01:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 385 transitions. [2025-03-17 00:01:34,230 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 385 transitions. Word has length 171 [2025-03-17 00:01:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:34,235 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 385 transitions. [2025-03-17 00:01:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2025-03-17 00:01:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 385 transitions. [2025-03-17 00:01:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:01:34,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:34,240 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:34,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 00:01:34,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 00:01:34,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:34,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1417262399, now seen corresponding path program 1 times [2025-03-17 00:01:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820774784] [2025-03-17 00:01:34,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:01:34,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:01:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:34,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820774784] [2025-03-17 00:01:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820774784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:01:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866626538] [2025-03-17 00:01:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:01:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:34,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:01:34,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:01:34,535 INFO L87 Difference]: Start difference. First operand 279 states and 385 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:34,690 INFO L93 Difference]: Finished difference Result 703 states and 963 transitions. [2025-03-17 00:01:34,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:01:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 00:01:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:34,695 INFO L225 Difference]: With dead ends: 703 [2025-03-17 00:01:34,696 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 00:01:34,697 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-03-17 00:01:34,697 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 110 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:34,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 239 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:01:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 00:01:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 279. [2025-03-17 00:01:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 216 states have (on average 1.2916666666666667) internal successors, (279), 216 states have internal predecessors, (279), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 00:01:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 383 transitions. [2025-03-17 00:01:34,750 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 383 transitions. Word has length 171 [2025-03-17 00:01:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:34,750 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 383 transitions. [2025-03-17 00:01:34,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 383 transitions. [2025-03-17 00:01:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:01:34,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:34,752 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:01:34,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1640288385, now seen corresponding path program 1 times [2025-03-17 00:01:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-17 00:01:34,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:34,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:01:34,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:01:34,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:34,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-17 00:01:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850020699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:35,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:01:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352336503] [2025-03-17 00:01:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:35,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:35,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:01:35,761 INFO L87 Difference]: Start difference. First operand 279 states and 383 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:36,435 INFO L93 Difference]: Finished difference Result 974 states and 1292 transitions. [2025-03-17 00:01:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:01:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 00:01:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:36,440 INFO L225 Difference]: With dead ends: 974 [2025-03-17 00:01:36,444 INFO L226 Difference]: Without dead ends: 696 [2025-03-17 00:01:36,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:01:36,446 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 195 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:36,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 473 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:01:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-17 00:01:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 452. [2025-03-17 00:01:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 359 states have internal predecessors, (461), 74 states have call successors, (74), 20 states have call predecessors, (74), 20 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 00:01:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 609 transitions. [2025-03-17 00:01:36,544 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 609 transitions. Word has length 171 [2025-03-17 00:01:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:36,549 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 609 transitions. [2025-03-17 00:01:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 609 transitions. [2025-03-17 00:01:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:01:36,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:36,550 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:36,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:01:36,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1007916784, now seen corresponding path program 1 times [2025-03-17 00:01:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:36,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-03-17 00:01:36,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:36,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:36,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:36,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:38,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001146097] [2025-03-17 00:01:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001146097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:38,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:01:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248368722] [2025-03-17 00:01:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:38,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:01:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:38,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:01:38,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:01:38,681 INFO L87 Difference]: Start difference. First operand 452 states and 609 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:40,872 INFO L93 Difference]: Finished difference Result 1205 states and 1620 transitions. [2025-03-17 00:01:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:01:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 00:01:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:40,881 INFO L225 Difference]: With dead ends: 1205 [2025-03-17 00:01:40,882 INFO L226 Difference]: Without dead ends: 791 [2025-03-17 00:01:40,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:01:40,884 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 298 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:40,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 937 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:01:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-17 00:01:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 609. [2025-03-17 00:01:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 481 states have (on average 1.2744282744282744) internal successors, (613), 484 states have internal predecessors, (613), 100 states have call successors, (100), 27 states have call predecessors, (100), 27 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 00:01:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 813 transitions. [2025-03-17 00:01:41,015 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 813 transitions. Word has length 172 [2025-03-17 00:01:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 813 transitions. [2025-03-17 00:01:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 813 transitions. [2025-03-17 00:01:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:01:41,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:41,019 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:41,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:01:41,020 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -784890798, now seen corresponding path program 1 times [2025-03-17 00:01:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43507277] [2025-03-17 00:01:41,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:41,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:41,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:41,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 00:01:41,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:01:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43507277] [2025-03-17 00:01:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43507277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:41,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:01:41,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141911284] [2025-03-17 00:01:41,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:01:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:01:41,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:01:41,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:01:41,623 INFO L87 Difference]: Start difference. First operand 609 states and 813 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:42,857 INFO L93 Difference]: Finished difference Result 1719 states and 2298 transitions. [2025-03-17 00:01:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:01:42,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 00:01:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:42,864 INFO L225 Difference]: With dead ends: 1719 [2025-03-17 00:01:42,864 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 00:01:42,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:01:42,868 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 191 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:01:42,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 824 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:01:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 00:01:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 936. [2025-03-17 00:01:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 730 states have (on average 1.2493150684931507) internal successors, (912), 734 states have internal predecessors, (912), 163 states have call successors, (163), 42 states have call predecessors, (163), 42 states have return successors, (163), 159 states have call predecessors, (163), 163 states have call successors, (163) [2025-03-17 00:01:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1238 transitions. [2025-03-17 00:01:43,090 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1238 transitions. Word has length 172 [2025-03-17 00:01:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:43,094 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1238 transitions. [2025-03-17 00:01:43,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 00:01:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1238 transitions. [2025-03-17 00:01:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:01:43,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:43,095 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:01:43,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:43,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -360283130, now seen corresponding path program 1 times [2025-03-17 00:01:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:01:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133198075] [2025-03-17 00:01:43,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:01:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:43,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:43,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:43,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:01:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348822404] [2025-03-17 00:01:43,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:43,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:01:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:43,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:01:43,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 00:01:43,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:43,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:43,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:43,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:01:43,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 00:01:43,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:01:43,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:01:43,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:43,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 00:01:43,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 00:01:43,678 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 00:01:43,680 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 00:01:43,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 00:01:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 00:01:43,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:01:44,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 00:01:44,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 12:01:44 BoogieIcfgContainer [2025-03-17 00:01:44,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 00:01:44,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 00:01:44,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 00:01:44,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 00:01:44,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:00:47" (3/4) ... [2025-03-17 00:01:44,081 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 00:01:44,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 00:01:44,086 INFO L158 Benchmark]: Toolchain (without parser) took 57827.24ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 132.4MB in the beginning and 488.5MB in the end (delta: -356.1MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2025-03-17 00:01:44,086 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:01:44,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.35ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 00:01:44,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.29ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:01:44,090 INFO L158 Benchmark]: Boogie Preprocessor took 59.38ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 112.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:01:44,090 INFO L158 Benchmark]: IcfgBuilder took 891.29ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 87.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 00:01:44,090 INFO L158 Benchmark]: TraceAbstraction took 56263.21ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 86.5MB in the beginning and 488.5MB in the end (delta: -402.0MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2025-03-17 00:01:44,090 INFO L158 Benchmark]: Witness Printer took 8.58ms. Allocated memory is still 570.4MB. Free memory was 488.5MB in the beginning and 488.5MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 00:01:44,092 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.46ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.35ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.29ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 115.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.38ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 112.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 891.29ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 87.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 56263.21ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 86.5MB in the beginning and 488.5MB in the end (delta: -402.0MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 8.58ms. Allocated memory is still 570.4MB. Free memory was 488.5MB in the beginning and 488.5MB in the end (delta: 49.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 shiftLeft at line 73, overapproximation of shiftLeft at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 99999999.01; [L44] float var_1_27 = 999999999.5; [L45] unsigned char var_1_28 = 2; [L46] unsigned char var_1_29 = 0; [L47] signed char var_1_30 = 5; [L48] signed char var_1_31 = 25; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L153] last_1_var_1_10 = var_1_10 [L154] last_1_var_1_12 = var_1_12 [L155] last_1_var_1_13 = var_1_13 [L165] RET updateLastVariables() [L166] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] var_1_5 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] var_1_6 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L119] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] var_1_7 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L124] var_1_8 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L125] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0, var_1_9=9/5] [L126] var_1_9 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L127] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L128] var_1_11 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L129] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L130] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L130] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L131] var_1_15 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L133] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L133] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L134] var_1_20 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L135] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L136] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L136] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L137] var_1_21 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L138] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L139] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L140] var_1_22 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L142] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L143] var_1_24 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L144] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L145] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L146] var_1_26 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L147] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L148] var_1_31 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L149] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L150] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L150] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L166] RET updateVariables() [L167] CALL step() [L55] COND TRUE var_1_20 || var_1_21 [L56] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_26 [L61] var_1_28 = 16 [L62] var_1_29 = 0 [L63] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=16, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L64] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L65] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=-255, var_1_12=12, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L67] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=-255, var_1_12=12, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L68] COND TRUE var_1_6 <= stepLocal_2 [L69] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L73] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=128, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L73] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L80] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L82] var_1_18 = var_1_3 [L83] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L84] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-255, stepLocal_4=1, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=256, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L85] COND FALSE !((- var_1_9) <= var_1_8) [L98] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=-255, stepLocal_4=1, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L100] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-255, stepLocal_4=1, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L101] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-255, stepLocal_4=1, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L101] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L102] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=-255, stepLocal_4=1, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L158-L159] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=-255, var_1_11=-255, var_1_12=12, var_1_13=12, var_1_15=256, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=1, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 160 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.0s, OverallIterations: 16, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3709 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3702 mSDsluCounter, 9145 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7085 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8118 IncrementalHoareTripleChecker+Invalid, 8545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 2060 mSDtfsCounter, 8118 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3271 GetRequests, 2987 SyntacticMatches, 1 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=936occurred in iteration=15, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 1878 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 4580 NumberOfCodeBlocks, 4580 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5387 ConstructedInterpolants, 45 QuantifiedInterpolants, 23779 SizeOfPredicates, 85 NumberOfNonLiveVariables, 4123 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 40329/41600 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-03-17 00:01:44,315 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 00:01:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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/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-10_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:01:47,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:01:47,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 00:01:47,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:01:47,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:01:47,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:01:47,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:01:47,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:01:47,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:01:47,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:01:47,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:01:47,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:01:47,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:01:47,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:01:47,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:01:47,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:01:47,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:01:47,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:01:47,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:01:47,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:01:47,864 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2025-03-17 00:01:48,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:01:48,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:01:48,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:01:48,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:01:48,460 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:01:48,461 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-10_file-9.i [2025-03-17 00:01:50,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3afe3b0/9b6f933de639427c8311d9cf6fafdb37/FLAGb4ed3b9a8 [2025-03-17 00:01:50,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:01:50,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2025-03-17 00:01:50,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3afe3b0/9b6f933de639427c8311d9cf6fafdb37/FLAGb4ed3b9a8 [2025-03-17 00:01:50,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3afe3b0/9b6f933de639427c8311d9cf6fafdb37 [2025-03-17 00:01:50,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:01:50,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:01:50,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:01:50,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:01:50,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:01:50,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:50,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5766820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50, skipping insertion in model container [2025-03-17 00:01:50,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:50,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:01:50,732 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-10_file-9.i[914,927] [2025-03-17 00:01:50,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:01:50,821 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:01:50,831 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-10_file-9.i[914,927] [2025-03-17 00:01:50,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:01:50,917 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:01:50,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50 WrapperNode [2025-03-17 00:01:50,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:01:50,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:01:50,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:01:50,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:01:50,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:50,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:50,988 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-17 00:01:50,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:01:50,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:01:50,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:01:50,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:01:50,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,031 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-17 00:01:51,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:01:51,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:01:51,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:01:51,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:01:51,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (1/1) ... [2025-03-17 00:01:51,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:01:51,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:01:51,115 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-17 00:01:51,122 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-17 00:01:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:01:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 00:01:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:01:51,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:01:51,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:01:51,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:01:51,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:01:51,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:01:52,050 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 00:01:52,050 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:01:52,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:01:52,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:01:52,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:01:52 BoogieIcfgContainer [2025-03-17 00:01:52,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:01:52,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:01:52,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:01:52,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:01:52,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:01:50" (1/3) ... [2025-03-17 00:01:52,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faf5b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:01:52, skipping insertion in model container [2025-03-17 00:01:52,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:01:50" (2/3) ... [2025-03-17 00:01:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faf5b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:01:52, skipping insertion in model container [2025-03-17 00:01:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:01:52" (3/3) ... [2025-03-17 00:01:52,099 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2025-03-17 00:01:52,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:01:52,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:01:52,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:01:52,267 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;@a67e1f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:01:52,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:01:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 00:01:52,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:52,302 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:52,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2080671810, now seen corresponding path program 1 times [2025-03-17 00:01:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:01:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741468764] [2025-03-17 00:01:52,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:52,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:01:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:01:52,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:01:52,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 00:01:52,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 00:01:52,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 00:01:52,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:52,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:01:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:01:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-17 00:01:52,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:01:52,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:01:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741468764] [2025-03-17 00:01:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741468764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:01:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:01:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:01:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103819848] [2025-03-17 00:01:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:01:52,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:01:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:01:52,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:01:52,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:01:52,885 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:01:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:01:52,933 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2025-03-17 00:01:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:01:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2025-03-17 00:01:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:01:52,943 INFO L225 Difference]: With dead ends: 133 [2025-03-17 00:01:52,947 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 00:01:52,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-17 00:01:52,958 INFO L435 NwaCegarLoop]: 101 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, 101 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-03-17 00:01:52,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:01:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 00:01:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 00:01:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 00:01:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2025-03-17 00:01:53,043 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 159 [2025-03-17 00:01:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:01:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2025-03-17 00:01:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 00:01:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2025-03-17 00:01:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 00:01:53,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:01:53,056 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:01:53,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 00:01:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:01:53,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:01:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:01:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 46579902, now seen corresponding path program 1 times [2025-03-17 00:01:53,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:01:53,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182926317] [2025-03-17 00:01:53,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:01:53,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:01:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:01:53,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:01:53,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 00:01:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 00:01:53,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 00:01:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:01:53,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:01:53,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 00:01:53,726 INFO L279 TraceCheckSpWp]: Computing forward predicates...