./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:07:10,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:07:10,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:07:10,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:07:10,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:07:10,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:07:10,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:07:10,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:07:10,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:07:10,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:07:10,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:07:10,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:07:10,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:07:10,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:07:10,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:07:10,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:07:10,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:07:10,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:07:10,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:10,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:07:10,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:07:10,172 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2025-03-08 10:07:10,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:07:10,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:07:10,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:07:10,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:07:10,412 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:07:10,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2025-03-08 10:07:11,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3216dc3a4/48a2bea7261e4a84a1b3a0227ced8143/FLAGe4b1b1621 [2025-03-08 10:07:11,766 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:07:11,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2025-03-08 10:07:11,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3216dc3a4/48a2bea7261e4a84a1b3a0227ced8143/FLAGe4b1b1621 [2025-03-08 10:07:12,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3216dc3a4/48a2bea7261e4a84a1b3a0227ced8143 [2025-03-08 10:07:12,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:07:12,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:07:12,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:12,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:07:12,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:07:12,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58179abf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12, skipping insertion in model container [2025-03-08 10:07:12,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:07:12,248 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_codestructure_normal_file-84.i[913,926] [2025-03-08 10:07:12,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:12,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:07:12,326 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_codestructure_normal_file-84.i[913,926] [2025-03-08 10:07:12,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:12,373 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:07:12,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12 WrapperNode [2025-03-08 10:07:12,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:12,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:12,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:07:12,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:07:12,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,421 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-03-08 10:07:12,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:12,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:07:12,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:07:12,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:07:12,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:07:12,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:07:12,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:07:12,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:07:12,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:07:12,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (1/1) ... [2025-03-08 10:07:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:12,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:07:12,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:07:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:07:12,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:07:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:07:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:07:12,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:07:12,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:07:12,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:07:12,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:07:12,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-08 10:07:12,901 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 10:07:12,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:07:12,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:07:12,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:07:12,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:12 BoogieIcfgContainer [2025-03-08 10:07:12,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:07:12,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:07:12,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:07:12,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:07:12,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:12" (1/3) ... [2025-03-08 10:07:12,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1116d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:12, skipping insertion in model container [2025-03-08 10:07:12,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:12" (2/3) ... [2025-03-08 10:07:12,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1116d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:12, skipping insertion in model container [2025-03-08 10:07:12,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:12" (3/3) ... [2025-03-08 10:07:12,936 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2025-03-08 10:07:12,947 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:07:12,949 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-84.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:07:12,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:07:13,010 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;@5d7deb52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:07:13,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:07:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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-08 10:07:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:07:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:13,029 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] [2025-03-08 10:07:13,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1147537085, now seen corresponding path program 1 times [2025-03-08 10:07:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:13,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130804437] [2025-03-08 10:07:13,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:13,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:07:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:07:13,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:13,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:13,316 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-08 10:07:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130804437] [2025-03-08 10:07:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130804437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:07:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285077062] [2025-03-08 10:07:13,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:13,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:13,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:13,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:13,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:07:13,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:07:13,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:07:13,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:13,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:13,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:07:13,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:13,493 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-08 10:07:13,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285077062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:13,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:07:13,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:07:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131904893] [2025-03-08 10:07:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:07:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:13,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:07:13,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:13,518 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-08 10:07:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:13,552 INFO L93 Difference]: Finished difference Result 160 states and 277 transitions. [2025-03-08 10:07:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:07:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 164 [2025-03-08 10:07:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:13,559 INFO L225 Difference]: With dead ends: 160 [2025-03-08 10:07:13,560 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 10:07:13,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:13,567 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:13,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 10:07:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 10:07:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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-08 10:07:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 123 transitions. [2025-03-08 10:07:13,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 123 transitions. Word has length 164 [2025-03-08 10:07:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:13,608 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 123 transitions. [2025-03-08 10:07:13,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-08 10:07:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 123 transitions. [2025-03-08 10:07:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:07:13,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:13,612 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] [2025-03-08 10:07:13,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:07:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:07:13,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1024559621, now seen corresponding path program 1 times [2025-03-08 10:07:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352003630] [2025-03-08 10:07:13,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:07:13,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:07:13,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:13,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:16,372 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-08 10:07:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352003630] [2025-03-08 10:07:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352003630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:07:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392771384] [2025-03-08 10:07:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:16,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:07:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:16,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:07:16,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:16,378 INFO L87 Difference]: Start difference. First operand 80 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 10:07:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:17,457 INFO L93 Difference]: Finished difference Result 221 states and 337 transitions. [2025-03-08 10:07:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:07:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 164 [2025-03-08 10:07:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:17,460 INFO L225 Difference]: With dead ends: 221 [2025-03-08 10:07:17,460 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 10:07:17,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:07:17,461 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 86 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:17,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 359 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:07:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 10:07:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 94. [2025-03-08 10:07:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-08 10:07:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2025-03-08 10:07:17,474 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 164 [2025-03-08 10:07:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:17,475 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2025-03-08 10:07:17,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 10:07:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2025-03-08 10:07:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:07:17,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:17,477 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] [2025-03-08 10:07:17,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:07:17,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:17,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash 617016354, now seen corresponding path program 1 times [2025-03-08 10:07:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:17,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482083789] [2025-03-08 10:07:17,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:17,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:07:17,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:07:17,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:17,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:18,561 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-08 10:07:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482083789] [2025-03-08 10:07:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482083789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:07:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923968134] [2025-03-08 10:07:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:07:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:18,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:07:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:18,563 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:18,870 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2025-03-08 10:07:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:07:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 165 [2025-03-08 10:07:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:18,873 INFO L225 Difference]: With dead ends: 219 [2025-03-08 10:07:18,873 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 10:07:18,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:07:18,874 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 86 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:18,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 329 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:07:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 10:07:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2025-03-08 10:07:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-08 10:07:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2025-03-08 10:07:18,886 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 165 [2025-03-08 10:07:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2025-03-08 10:07:18,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2025-03-08 10:07:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:07:18,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:18,891 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] [2025-03-08 10:07:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:07:18,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 106482177, now seen corresponding path program 1 times [2025-03-08 10:07:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813825001] [2025-03-08 10:07:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:18,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:07:18,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:07:18,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:18,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:19,756 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-08 10:07:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813825001] [2025-03-08 10:07:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813825001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:07:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112681679] [2025-03-08 10:07:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:07:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:19,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:07:19,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:19,758 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:20,514 INFO L93 Difference]: Finished difference Result 233 states and 363 transitions. [2025-03-08 10:07:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:07:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 165 [2025-03-08 10:07:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:20,517 INFO L225 Difference]: With dead ends: 233 [2025-03-08 10:07:20,517 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 10:07:20,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:07:20,518 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:20,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 333 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:07:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 10:07:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 96. [2025-03-08 10:07:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 68 states have internal predecessors, (98), 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-08 10:07:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2025-03-08 10:07:20,532 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 165 [2025-03-08 10:07:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:20,533 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2025-03-08 10:07:20,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2025-03-08 10:07:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:07:20,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:20,537 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] [2025-03-08 10:07:20,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:07:20,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash -890590176, now seen corresponding path program 1 times [2025-03-08 10:07:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755956514] [2025-03-08 10:07:20,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:20,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:07:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:07:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:23,092 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-08 10:07:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755956514] [2025-03-08 10:07:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755956514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:07:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50104153] [2025-03-08 10:07:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:07:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:07:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:23,096 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:24,309 INFO L93 Difference]: Finished difference Result 253 states and 389 transitions. [2025-03-08 10:07:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:07:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 165 [2025-03-08 10:07:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:24,312 INFO L225 Difference]: With dead ends: 253 [2025-03-08 10:07:24,312 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 10:07:24,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:07:24,313 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 84 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:24,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 330 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 10:07:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 10:07:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2025-03-08 10:07:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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-08 10:07:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-03-08 10:07:24,325 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 165 [2025-03-08 10:07:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:24,325 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-03-08 10:07:24,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-08 10:07:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-03-08 10:07:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:07:24,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:24,327 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] [2025-03-08 10:07:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:07:24,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:24,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -170041277, now seen corresponding path program 1 times [2025-03-08 10:07:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840297062] [2025-03-08 10:07:24,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:24,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:07:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:07:24,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:26,699 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-08 10:07:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840297062] [2025-03-08 10:07:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840297062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:07:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698229497] [2025-03-08 10:07:26,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:07:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:26,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:07:26,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:07:26,701 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:27,486 INFO L93 Difference]: Finished difference Result 307 states and 457 transitions. [2025-03-08 10:07:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:07:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-03-08 10:07:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:27,492 INFO L225 Difference]: With dead ends: 307 [2025-03-08 10:07:27,493 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 10:07:27,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:07:27,495 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 402 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:27,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 462 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:07:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 10:07:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 222. [2025-03-08 10:07:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 159 states have (on average 1.3584905660377358) internal successors, (216), 161 states have internal predecessors, (216), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:07:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 332 transitions. [2025-03-08 10:07:27,526 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 332 transitions. Word has length 166 [2025-03-08 10:07:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:27,531 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 332 transitions. [2025-03-08 10:07:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 332 transitions. [2025-03-08 10:07:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:07:27,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:27,532 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] [2025-03-08 10:07:27,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:07:27,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:27,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1337510532, now seen corresponding path program 1 times [2025-03-08 10:07:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:27,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470993461] [2025-03-08 10:07:27,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:27,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:07:27,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:07:27,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:27,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:29,303 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-08 10:07:29,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:29,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470993461] [2025-03-08 10:07:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470993461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:29,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:07:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857692530] [2025-03-08 10:07:29,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:07:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:29,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:07:29,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:07:29,305 INFO L87 Difference]: Start difference. First operand 222 states and 332 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-08 10:07:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:30,233 INFO L93 Difference]: Finished difference Result 492 states and 720 transitions. [2025-03-08 10:07:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:07:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 166 [2025-03-08 10:07:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:30,236 INFO L225 Difference]: With dead ends: 492 [2025-03-08 10:07:30,236 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 10:07:30,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:07:30,237 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 226 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:30,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 603 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:07:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 10:07:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 209. [2025-03-08 10:07:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 146 states have (on average 1.356164383561644) internal successors, (198), 148 states have internal predecessors, (198), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 10:07:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 314 transitions. [2025-03-08 10:07:30,262 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 314 transitions. Word has length 166 [2025-03-08 10:07:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:30,262 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 314 transitions. [2025-03-08 10:07:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-08 10:07:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 314 transitions. [2025-03-08 10:07:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 10:07:30,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:30,264 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] [2025-03-08 10:07:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:07:30,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 831951907, now seen corresponding path program 1 times [2025-03-08 10:07:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:30,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24222121] [2025-03-08 10:07:30,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 10:07:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 10:07:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:32,100 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-08 10:07:32,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24222121] [2025-03-08 10:07:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24222121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:07:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434487653] [2025-03-08 10:07:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:07:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:32,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:07:32,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:07:32,102 INFO L87 Difference]: Start difference. First operand 209 states and 314 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:32,891 INFO L93 Difference]: Finished difference Result 482 states and 705 transitions. [2025-03-08 10:07:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:07:32,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-03-08 10:07:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:32,893 INFO L225 Difference]: With dead ends: 482 [2025-03-08 10:07:32,893 INFO L226 Difference]: Without dead ends: 280 [2025-03-08 10:07:32,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:07:32,894 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 205 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:32,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 659 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:07:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-08 10:07:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 240. [2025-03-08 10:07:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 174 states have internal predecessors, (228), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 10:07:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 352 transitions. [2025-03-08 10:07:32,917 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 352 transitions. Word has length 166 [2025-03-08 10:07:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 352 transitions. [2025-03-08 10:07:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 352 transitions. [2025-03-08 10:07:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 10:07:32,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:32,919 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] [2025-03-08 10:07:32,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:07:32,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -977096928, now seen corresponding path program 1 times [2025-03-08 10:07:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:32,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897684766] [2025-03-08 10:07:32,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:32,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 10:07:32,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 10:07:32,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:32,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:37,338 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-08 10:07:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:37,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897684766] [2025-03-08 10:07:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897684766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:37,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:37,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 10:07:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177751305] [2025-03-08 10:07:37,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 10:07:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:37,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 10:07:37,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:07:37,339 INFO L87 Difference]: Start difference. First operand 240 states and 352 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:41,433 INFO L93 Difference]: Finished difference Result 572 states and 820 transitions. [2025-03-08 10:07:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:07:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2025-03-08 10:07:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:41,439 INFO L225 Difference]: With dead ends: 572 [2025-03-08 10:07:41,439 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 10:07:41,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:07:41,440 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 344 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:41,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 590 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 10:07:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 10:07:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 445. [2025-03-08 10:07:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 345 states have (on average 1.3594202898550725) internal successors, (469), 353 states have internal predecessors, (469), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 78 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:07:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 641 transitions. [2025-03-08 10:07:41,479 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 641 transitions. Word has length 167 [2025-03-08 10:07:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:41,479 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 641 transitions. [2025-03-08 10:07:41,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:07:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 641 transitions. [2025-03-08 10:07:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 10:07:41,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:41,481 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] [2025-03-08 10:07:41,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:07:41,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:41,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1309118840, now seen corresponding path program 1 times [2025-03-08 10:07:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544004231] [2025-03-08 10:07:41,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:41,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 10:07:41,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 10:07:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:41,612 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-08 10:07:41,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544004231] [2025-03-08 10:07:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544004231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:41,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:07:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872148033] [2025-03-08 10:07:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:41,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:07:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:41,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:07:41,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:07:41,615 INFO L87 Difference]: Start difference. First operand 445 states and 641 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-08 10:07:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:41,731 INFO L93 Difference]: Finished difference Result 887 states and 1278 transitions. [2025-03-08 10:07:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:07:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 167 [2025-03-08 10:07:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:41,735 INFO L225 Difference]: With dead ends: 887 [2025-03-08 10:07:41,735 INFO L226 Difference]: Without dead ends: 449 [2025-03-08 10:07:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:07:41,738 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:41,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:07:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-08 10:07:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-03-08 10:07:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 347 states have (on average 1.3573487031700289) internal successors, (471), 355 states have internal predecessors, (471), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 78 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:07:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 643 transitions. [2025-03-08 10:07:41,773 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 643 transitions. Word has length 167 [2025-03-08 10:07:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 643 transitions. [2025-03-08 10:07:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-08 10:07:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 643 transitions. [2025-03-08 10:07:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 10:07:41,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:41,774 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] [2025-03-08 10:07:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:07:41,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1308460787, now seen corresponding path program 1 times [2025-03-08 10:07:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729383787] [2025-03-08 10:07:41,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:41,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 10:07:41,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 10:07:41,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:41,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:41,834 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-08 10:07:41,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:41,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729383787] [2025-03-08 10:07:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729383787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:41,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:41,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:07:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258109628] [2025-03-08 10:07:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:41,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:07:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:41,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:07:41,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:07:41,838 INFO L87 Difference]: Start difference. First operand 447 states and 643 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 10:07:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:41,944 INFO L93 Difference]: Finished difference Result 1170 states and 1661 transitions. [2025-03-08 10:07:41,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:07:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 167 [2025-03-08 10:07:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:41,951 INFO L225 Difference]: With dead ends: 1170 [2025-03-08 10:07:41,951 INFO L226 Difference]: Without dead ends: 730 [2025-03-08 10:07:41,953 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-08 10:07:41,953 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 41 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:41,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 195 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:07:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-08 10:07:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 565. [2025-03-08 10:07:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 450 states have (on average 1.3688888888888888) internal successors, (616), 461 states have internal predecessors, (616), 98 states have call successors, (98), 16 states have call predecessors, (98), 16 states have return successors, (98), 87 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 10:07:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 812 transitions. [2025-03-08 10:07:42,009 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 812 transitions. Word has length 167 [2025-03-08 10:07:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:42,009 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 812 transitions. [2025-03-08 10:07:42,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08 10:07:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 812 transitions. [2025-03-08 10:07:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 10:07:42,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:42,011 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-08 10:07:42,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:07:42,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:42,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash -558040245, now seen corresponding path program 1 times [2025-03-08 10:07:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153358673] [2025-03-08 10:07:42,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:42,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 10:07:42,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 10:07:42,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:42,113 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-08 10:07:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:07:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153358673] [2025-03-08 10:07:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153358673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:07:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860027217] [2025-03-08 10:07:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:07:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:07:42,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:07:42,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:07:42,115 INFO L87 Difference]: Start difference. First operand 565 states and 812 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 10:07:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:42,246 INFO L93 Difference]: Finished difference Result 821 states and 1185 transitions. [2025-03-08 10:07:42,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:07:42,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 10:07:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:42,250 INFO L225 Difference]: With dead ends: 821 [2025-03-08 10:07:42,250 INFO L226 Difference]: Without dead ends: 565 [2025-03-08 10:07:42,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:07:42,251 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 119 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:07:42,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 505 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:07:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-08 10:07:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2025-03-08 10:07:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 448 states have (on average 1.359375) internal successors, (609), 459 states have internal predecessors, (609), 98 states have call successors, (98), 16 states have call predecessors, (98), 16 states have return successors, (98), 87 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-08 10:07:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 805 transitions. [2025-03-08 10:07:42,293 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 805 transitions. Word has length 168 [2025-03-08 10:07:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:42,293 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 805 transitions. [2025-03-08 10:07:42,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-08 10:07:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 805 transitions. [2025-03-08 10:07:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 10:07:42,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:42,295 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-08 10:07:42,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:07:42,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:42,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1027309183, now seen corresponding path program 1 times [2025-03-08 10:07:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:07:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642621667] [2025-03-08 10:07:42,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:07:42,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 10:07:42,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 10:07:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:07:42,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027825876] [2025-03-08 10:07:42,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:42,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:07:42,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:42,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:07:42,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:07:42,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 10:07:42,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 10:07:42,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:07:42,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:07:42,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 10:07:42,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 10:07:42,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:42,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:07:42,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:07:42,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:07:42,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:07:42,563 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-08 10:07:42,756 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,SelfDestructingSolverStorable12 [2025-03-08 10:07:42,758 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:07:42,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:07:42,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:07:42 BoogieIcfgContainer [2025-03-08 10:07:42,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:07:42,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:07:42,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:07:42,845 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:07:42,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:12" (3/4) ... [2025-03-08 10:07:42,847 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:07:42,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:07:42,849 INFO L158 Benchmark]: Toolchain (without parser) took 30722.24ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 113.1MB in the beginning and 223.7MB in the end (delta: -110.6MB). Peak memory consumption was 349.1MB. Max. memory is 16.1GB. [2025-03-08 10:07:42,849 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory was 123.8MB in the beginning and 123.5MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:42,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.06ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 99.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:07:42,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:42,849 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:42,850 INFO L158 Benchmark]: IcfgBuilder took 457.89ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 64.5MB in the end (delta: 26.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 10:07:42,850 INFO L158 Benchmark]: TraceAbstraction took 29912.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 63.6MB in the beginning and 223.8MB in the end (delta: -160.2MB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. [2025-03-08 10:07:42,850 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 604.0MB. Free memory was 223.8MB in the beginning and 223.7MB in the end (delta: 126.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:07:42,851 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.29ms. Allocated memory is still 201.3MB. Free memory was 123.8MB in the beginning and 123.5MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.06ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 99.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 91.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 457.89ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 64.5MB in the end (delta: 26.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29912.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 63.6MB in the beginning and 223.8MB in the end (delta: -160.2MB). Peak memory consumption was 298.8MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 604.0MB. Free memory was 223.8MB in the beginning and 223.7MB in the end (delta: 126.2kB). 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 someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L106] var_1_14 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L107] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L108] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L109] var_1_16 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L110] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L111] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L112] var_1_17 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L113] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L114] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L115] var_1_21 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L116] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L129] RET updateVariables() [L130] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L49] COND FALSE !(-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L54] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L54] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L59] var_1_9 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L61] COND TRUE var_1_3 <= var_1_1 [L62] var_1_12 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L66] COND TRUE (~ var_1_3) < var_1_14 [L67] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L69] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L69] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L70] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=1, var_1_19=0, var_1_1=3, var_1_20=49/10, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L74] var_1_18 = var_1_17 [L75] var_1_19 = 0 [L76] var_1_20 = var_1_21 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L121-L122] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=3, var_1_14=0, var_1_15=66, var_1_16=1, var_1_17=32767, var_1_18=32767, var_1_19=0, var_1_1=3, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=3, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 154 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1707 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1707 mSDsluCounter, 4768 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3261 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4219 IncrementalHoareTripleChecker+Invalid, 4346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 1507 mSDtfsCounter, 4219 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=565occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 541 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2141 ConstructedInterpolants, 0 QuantifiedInterpolants, 15417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 16850/16900 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-08 10:07:42,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_codestructure_normal_file-84.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 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:07:44,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:07:44,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:07:44,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:07:44,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:07:44,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:07:44,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:07:44,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:07:44,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:07:44,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:07:44,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:07:44,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:07:44,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:07:44,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:07:44,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:07:44,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:07:44,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:44,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:07:44,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:07:44,906 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 -> 6814e4b1182b075f519057bacd5c07f341f45068ab378c95bdf1e389d807335f [2025-03-08 10:07:45,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:07:45,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:07:45,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:07:45,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:07:45,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:07:45,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2025-03-08 10:07:46,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2ec7bc/4cf42e35e1e84a79bb13aa98686dcbf7/FLAG5e60a5fdc [2025-03-08 10:07:46,551 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:07:46,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-84.i [2025-03-08 10:07:46,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2ec7bc/4cf42e35e1e84a79bb13aa98686dcbf7/FLAG5e60a5fdc [2025-03-08 10:07:46,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ae2ec7bc/4cf42e35e1e84a79bb13aa98686dcbf7 [2025-03-08 10:07:46,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:07:46,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:07:46,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:46,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:07:46,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:07:46,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68377816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46, skipping insertion in model container [2025-03-08 10:07:46,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:07:46,711 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_codestructure_normal_file-84.i[913,926] [2025-03-08 10:07:46,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:46,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:07:46,798 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_codestructure_normal_file-84.i[913,926] [2025-03-08 10:07:46,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:07:46,850 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:07:46,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46 WrapperNode [2025-03-08 10:07:46,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:07:46,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:46,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:07:46,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:07:46,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,891 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2025-03-08 10:07:46,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:07:46,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:07:46,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:07:46,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:07:46,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:07:46,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:07:46,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:07:46,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:07:46,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:07:46,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (1/1) ... [2025-03-08 10:07:46,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:07:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:07:46,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:07:46,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:07:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:07:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:07:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:07:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:07:46,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:07:46,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:07:47,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:07:47,052 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:07:47,398 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 10:07:47,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:07:47,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:07:47,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:07:47,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:47 BoogieIcfgContainer [2025-03-08 10:07:47,408 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:07:47,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:07:47,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:07:47,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:07:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:46" (1/3) ... [2025-03-08 10:07:47,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fbd455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:47, skipping insertion in model container [2025-03-08 10:07:47,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:46" (2/3) ... [2025-03-08 10:07:47,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fbd455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:47, skipping insertion in model container [2025-03-08 10:07:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:47" (3/3) ... [2025-03-08 10:07:47,419 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-84.i [2025-03-08 10:07:47,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:07:47,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-84.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:07:47,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:07:47,490 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;@718afc3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:07:47,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:07:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 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-08 10:07:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 10:07:47,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:47,506 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] [2025-03-08 10:07:47,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:47,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash -696935244, now seen corresponding path program 1 times [2025-03-08 10:07:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:07:47,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666581895] [2025-03-08 10:07:47,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:47,519 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-08 10:07:47,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:07:47,521 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-08 10:07:47,524 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-08 10:07:47,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 10:07:47,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 10:07:47,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:47,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:47,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:07:47,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:07:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 10:07:47,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:07:47,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:07:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666581895] [2025-03-08 10:07:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666581895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:07:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:07:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:07:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100504334] [2025-03-08 10:07:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:07:47,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:07:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:07:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:07:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:47,805 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-08 10:07:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:07:47,822 INFO L93 Difference]: Finished difference Result 124 states and 221 transitions. [2025-03-08 10:07:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:07:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 158 [2025-03-08 10:07:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:07:47,829 INFO L225 Difference]: With dead ends: 124 [2025-03-08 10:07:47,829 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 10:07:47,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:07:47,833 INFO L435 NwaCegarLoop]: 95 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, 95 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-08 10:07:47,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:07:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 10:07:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 10:07:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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-08 10:07:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2025-03-08 10:07:47,866 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 158 [2025-03-08 10:07:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:07:47,868 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2025-03-08 10:07:47,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-08 10:07:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2025-03-08 10:07:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 10:07:47,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:07:47,870 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] [2025-03-08 10:07:47,878 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-08 10:07:48,070 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-08 10:07:48,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:07:48,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:07:48,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1779525366, now seen corresponding path program 1 times [2025-03-08 10:07:48,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:07:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725078887] [2025-03-08 10:07:48,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:07:48,072 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-08 10:07:48,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:07:48,074 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-08 10:07:48,076 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-08 10:07:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 10:07:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 10:07:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:07:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:07:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 10:07:48,277 INFO L279 TraceCheckSpWp]: Computing forward predicates...