./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:38:26,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:38:26,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:38:26,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:38:26,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:38:26,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:38:26,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:38:26,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:38:26,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:38:26,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:38:26,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:38:26,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:38:26,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:38:26,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:38:26,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:38:26,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:38:26,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:38:26,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:38:26,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:26,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:38:26,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:38:26,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:38:26,229 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2025-03-03 19:38:26,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:38:26,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:38:26,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:38:26,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:38:26,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:38:26,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:27,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40bac8ec7/204ca43d34cb4b27b16e509fed119589/FLAGf06240b53 [2025-03-03 19:38:27,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:38:27,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:27,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40bac8ec7/204ca43d34cb4b27b16e509fed119589/FLAGf06240b53 [2025-03-03 19:38:28,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40bac8ec7/204ca43d34cb4b27b16e509fed119589 [2025-03-03 19:38:28,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:38:28,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:38:28,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:28,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:38:28,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:38:28,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd8bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28, skipping insertion in model container [2025-03-03 19:38:28,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:38:28,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2025-03-03 19:38:28,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:28,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:38:28,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2025-03-03 19:38:28,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:28,377 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:38:28,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28 WrapperNode [2025-03-03 19:38:28,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:28,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:28,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:38:28,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:38:28,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,428 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-03-03 19:38:28,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:28,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:38:28,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:38:28,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:38:28,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,453 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-03 19:38:28,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:38:28,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:38:28,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:38:28,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:38:28,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (1/1) ... [2025-03-03 19:38:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:28,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:28,500 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-03 19:38:28,502 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-03 19:38:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:38:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:38:28,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:38:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:38:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:38:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:38:28,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:38:28,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:38:28,857 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1; [2025-03-03 19:38:28,884 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 19:38:28,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:38:28,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:38:28,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:38:28,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:28 BoogieIcfgContainer [2025-03-03 19:38:28,899 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:38:28,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:38:28,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:38:28,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:38:28,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:38:28" (1/3) ... [2025-03-03 19:38:28,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406b1584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:28, skipping insertion in model container [2025-03-03 19:38:28,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:28" (2/3) ... [2025-03-03 19:38:28,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406b1584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:28, skipping insertion in model container [2025-03-03 19:38:28,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:28" (3/3) ... [2025-03-03 19:38:28,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:28,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:38:28,921 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:38:28,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:38:28,980 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;@e779ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:38:28,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:38:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:38:28,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:28,998 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:28,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 673351721, now seen corresponding path program 1 times [2025-03-03 19:38:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:29,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710098690] [2025-03-03 19:38:29,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:29,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:29,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:29,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:38:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710098690] [2025-03-03 19:38:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710098690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:38:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497643183] [2025-03-03 19:38:29,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:29,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:38:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:29,281 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-03 19:38:29,282 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-03 19:38:29,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:29,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:29,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:29,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:29,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:38:29,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:38:29,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497643183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:29,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:38:29,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:38:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117003] [2025-03-03 19:38:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:29,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:38:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:29,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:38:29,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:38:29,462 INFO L87 Difference]: Start difference. First operand has 97 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 67 states have internal predecessors, (94), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:38:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:29,497 INFO L93 Difference]: Finished difference Result 188 states and 323 transitions. [2025-03-03 19:38:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:38:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-03-03 19:38:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:29,504 INFO L225 Difference]: With dead ends: 188 [2025-03-03 19:38:29,505 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 19:38:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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-03 19:38:29,509 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:29,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:38:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 19:38:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 19:38:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2025-03-03 19:38:29,544 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 181 [2025-03-03 19:38:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:29,544 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2025-03-03 19:38:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:38:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2025-03-03 19:38:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:38:29,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:29,547 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:29,553 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-03 19:38:29,749 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-03 19:38:29,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:29,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1899094121, now seen corresponding path program 1 times [2025-03-03 19:38:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:29,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-03 19:38:29,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:29,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:29,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:29,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:29,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-03 19:38:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:30,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:30,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:38:30,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296084512] [2025-03-03 19:38:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:30,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:38:30,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:30,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:38:30,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:38:30,047 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:30,081 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-03 19:38:30,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:38:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 19:38:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:30,084 INFO L225 Difference]: With dead ends: 185 [2025-03-03 19:38:30,084 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 19:38:30,085 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-03 19:38:30,086 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:30,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:38:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 19:38:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 19:38:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-03-03 19:38:30,099 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 181 [2025-03-03 19:38:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-03-03 19:38:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-03-03 19:38:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:38:30,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:30,103 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:30,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:38:30,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:30,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1054622250, now seen corresponding path program 1 times [2025-03-03 19:38:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773539078] [2025-03-03 19:38:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:30,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773539078] [2025-03-03 19:38:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773539078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:38:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886549254] [2025-03-03 19:38:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:38:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:38:30,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:38:30,497 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:30,645 INFO L93 Difference]: Finished difference Result 185 states and 281 transitions. [2025-03-03 19:38:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:38:30,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 19:38:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:30,647 INFO L225 Difference]: With dead ends: 185 [2025-03-03 19:38:30,647 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 19:38:30,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03 19:38:30,648 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 88 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:30,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 207 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:38:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 19:38:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 19:38:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2025-03-03 19:38:30,668 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 181 [2025-03-03 19:38:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:30,668 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2025-03-03 19:38:30,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2025-03-03 19:38:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:38:30,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:30,670 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:38:30,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1732793237, now seen corresponding path program 1 times [2025-03-03 19:38:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321982601] [2025-03-03 19:38:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:30,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:30,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:30,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:30,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:31,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321982601] [2025-03-03 19:38:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321982601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:38:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765906176] [2025-03-03 19:38:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:38:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:31,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:38:31,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:38:31,005 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:31,331 INFO L93 Difference]: Finished difference Result 275 states and 415 transitions. [2025-03-03 19:38:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:38:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 19:38:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:31,334 INFO L225 Difference]: With dead ends: 275 [2025-03-03 19:38:31,336 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 19:38:31,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:38:31,337 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 237 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:31,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 307 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:38:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 19:38:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 118. [2025-03-03 19:38:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2025-03-03 19:38:31,364 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 181 [2025-03-03 19:38:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:31,365 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2025-03-03 19:38:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2025-03-03 19:38:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 19:38:31,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:31,367 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:31,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:38:31,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -379483540, now seen corresponding path program 1 times [2025-03-03 19:38:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860293090] [2025-03-03 19:38:31,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:31,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 19:38:31,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 19:38:31,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:31,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:31,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860293090] [2025-03-03 19:38:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860293090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:38:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901913821] [2025-03-03 19:38:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:31,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:38:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:31,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:38:31,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:38:31,556 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:31,681 INFO L93 Difference]: Finished difference Result 299 states and 446 transitions. [2025-03-03 19:38:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:38:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-03-03 19:38:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:31,683 INFO L225 Difference]: With dead ends: 299 [2025-03-03 19:38:31,684 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 19:38:31,684 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-03 19:38:31,686 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 126 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:31,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 367 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:38:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 19:38:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 118. [2025-03-03 19:38:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2025-03-03 19:38:31,718 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 181 [2025-03-03 19:38:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:31,718 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2025-03-03 19:38:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2025-03-03 19:38:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:38:31,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:31,721 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:38:31,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:31,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash -94311202, now seen corresponding path program 1 times [2025-03-03 19:38:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-03 19:38:31,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:31,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:31,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:31,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:31,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 19:38:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539449806] [2025-03-03 19:38:31,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539449806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:38:31,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236317137] [2025-03-03 19:38:31,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:38:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:31,998 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-03 19:38:32,000 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-03 19:38:32,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:32,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:32,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:32,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:32,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:38:32,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 797 proven. 78 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 19:38:32,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:38:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 19:38:32,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236317137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:38:32,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:38:32,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-03 19:38:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600845729] [2025-03-03 19:38:32,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:38:32,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:38:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:32,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:38:32,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:38:32,616 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 19:38:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:33,616 INFO L93 Difference]: Finished difference Result 519 states and 746 transitions. [2025-03-03 19:38:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 19:38:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 183 [2025-03-03 19:38:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:33,641 INFO L225 Difference]: With dead ends: 519 [2025-03-03 19:38:33,641 INFO L226 Difference]: Without dead ends: 404 [2025-03-03 19:38:33,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=446, Invalid=1276, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 19:38:33,642 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 612 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:33,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 656 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:38:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-03 19:38:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 215. [2025-03-03 19:38:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 152 states have internal predecessors, (194), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 19:38:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2025-03-03 19:38:33,696 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 183 [2025-03-03 19:38:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:33,697 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2025-03-03 19:38:33,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-03 19:38:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2025-03-03 19:38:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:38:33,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:33,698 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:33,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:38:33,899 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,SelfDestructingSolverStorable5 [2025-03-03 19:38:33,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1713143261, now seen corresponding path program 1 times [2025-03-03 19:38:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-03-03 19:38:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:33,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:33,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:33,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:33,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:38:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596356272] [2025-03-03 19:38:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:38:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:33,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:38:33,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:38:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:34,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:34,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:34,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:38:34,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:38:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:38:34,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:38:34,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:38:34,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:38:34,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:38:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:38:34,419 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:38:34,516 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:38:34,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:38:34 BoogieIcfgContainer [2025-03-03 19:38:34,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:38:34,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:38:34,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:38:34,521 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:38:34,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:28" (3/4) ... [2025-03-03 19:38:34,523 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:38:34,524 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:38:34,525 INFO L158 Benchmark]: Toolchain (without parser) took 6392.79ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 153.8MB in the beginning and 115.0MB in the end (delta: 38.7MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2025-03-03 19:38:34,525 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:38:34,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.26ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 139.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:38:34,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.98ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 136.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:38:34,526 INFO L158 Benchmark]: Boogie Preprocessor took 36.66ms. Allocated memory is still 201.3MB. Free memory was 136.4MB in the beginning and 133.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:38:34,526 INFO L158 Benchmark]: IcfgBuilder took 431.89ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 107.1MB in the end (delta: 26.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 19:38:34,526 INFO L158 Benchmark]: TraceAbstraction took 5620.54ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 115.1MB in the end (delta: -8.8MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2025-03-03 19:38:34,527 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 251.7MB. Free memory was 115.1MB in the beginning and 115.0MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:38:34,528 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.31ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.26ms. Allocated memory is still 201.3MB. Free memory was 153.3MB in the beginning and 139.3MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.98ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 136.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.66ms. Allocated memory is still 201.3MB. Free memory was 136.4MB in the beginning and 133.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.89ms. Allocated memory is still 201.3MB. Free memory was 133.1MB in the beginning and 107.1MB in the end (delta: 26.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5620.54ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 115.1MB in the end (delta: -8.8MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 251.7MB. Free memory was 115.1MB in the beginning and 115.0MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 161. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_25 = 2; [L42] unsigned long int var_1_26 = 1; [L43] unsigned short int var_1_27 = 256; [L44] unsigned short int var_1_28 = 10; [L45] unsigned short int var_1_29 = 16; [L46] signed long int var_1_30 = -16; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] signed long int last_1_var_1_9 = -50; VAL [isInitial=0, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=50, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_5 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L115] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L116] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L117] var_1_6 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L118] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L119] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L120] var_1_8 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L121] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L122] var_1_14 = __VERIFIER_nondet_ulong() [L123] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L123] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L124] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L125] var_1_15 = __VERIFIER_nondet_ulong() [L126] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L126] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L127] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L128] var_1_16 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L131] var_1_17 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L132] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L133] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L134] var_1_18 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L135] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L136] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L137] var_1_20 = __VERIFIER_nondet_ushort() [L138] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L138] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L139] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L140] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L141] var_1_23 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L142] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L143] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L144] var_1_25 = __VERIFIER_nondet_ulong() [L145] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L146] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=10, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L147] var_1_28 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] CALL assume_abort_if_not(var_1_28 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L149] RET assume_abort_if_not(var_1_28 <= 65534) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] var_1_31 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=5, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] var_1_33 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=256, var_1_28=0, var_1_29=16, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_24 = var_1_25 [L55] var_1_26 = var_1_25 [L56] var_1_27 = var_1_28 [L57] var_1_29 = var_1_28 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] EXPR var_1_29 & var_1_27 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=32, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L58] COND FALSE !(var_1_24 <= (var_1_29 & var_1_27)) [L63] var_1_32 = var_1_33 [L64] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] var_1_21 = var_1_6 [L69] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L74] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L77] signed long int stepLocal_3 = var_1_9; [L78] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L79] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L80] COND FALSE !(var_1_9 <= stepLocal_2) [L89] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L98] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L100] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L101] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L102] COND TRUE \read(var_1_13) [L103] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L170] RET step() [L171] CALL, EXPR property() [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L161-L162] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=4294967296, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-16, var_1_31=0, var_1_32=0, var_1_33=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1078 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1063 mSDsluCounter, 1948 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1036 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 912 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 557 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 321 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1818 NumberOfCodeBlocks, 1818 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1626 ConstructedInterpolants, 0 QuantifiedInterpolants, 3276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 13392/13608 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-03 19:38:34,548 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_fillercode_fillercodesize_ps-cn-10_file-61.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 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:38:36,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:38:36,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:38:36,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:38:36,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:38:36,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:38:36,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:38:36,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:38:36,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:38:36,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:38:36,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:38:36,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:38:36,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:38:36,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:38:36,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:38:36,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:38:36,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:38:36,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:38:36,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:36,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:38:36,468 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:38:36,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:38:36,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:38:36,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:38:36,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:38:36,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:38:36,469 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 -> 1c87c35ab7f46dfa906881dc78cf3989a4c72119f7f55258ddc47878726c0a4a [2025-03-03 19:38:36,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:38:36,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:38:36,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:38:36,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:38:36,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:38:36,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:37,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212101fd/0409b944dbbb4ba9b87ee6bbf9e947f7/FLAG3a66b1680 [2025-03-03 19:38:38,076 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:38:38,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:38,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212101fd/0409b944dbbb4ba9b87ee6bbf9e947f7/FLAG3a66b1680 [2025-03-03 19:38:38,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4212101fd/0409b944dbbb4ba9b87ee6bbf9e947f7 [2025-03-03 19:38:38,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:38:38,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:38:38,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:38,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:38:38,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:38:38,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69701ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38, skipping insertion in model container [2025-03-03 19:38:38,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:38:38,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2025-03-03 19:38:38,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:38,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:38:38,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-61.i[915,928] [2025-03-03 19:38:38,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:38,362 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:38:38,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38 WrapperNode [2025-03-03 19:38:38,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:38,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:38,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:38:38,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:38:38,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,394 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-03-03 19:38:38,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:38,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:38:38,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:38:38,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:38:38,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,416 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-03 19:38:38,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:38:38,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:38:38,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:38:38,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:38:38,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (1/1) ... [2025-03-03 19:38:38,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:38,467 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-03 19:38:38,469 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-03 19:38:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:38:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:38:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:38:38,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:38:38,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:38:38,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:38:38,570 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:38:38,572 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:38:39,018 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:38:39,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:38:39,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:38:39,026 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:38:39,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:39 BoogieIcfgContainer [2025-03-03 19:38:39,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:38:39,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:38:39,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:38:39,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:38:39,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:38:38" (1/3) ... [2025-03-03 19:38:39,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e24f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:39, skipping insertion in model container [2025-03-03 19:38:39,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:38" (2/3) ... [2025-03-03 19:38:39,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e24f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:39, skipping insertion in model container [2025-03-03 19:38:39,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:39" (3/3) ... [2025-03-03 19:38:39,033 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i [2025-03-03 19:38:39,045 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:38:39,046 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-61.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:38:39,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:38:39,097 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;@4f6b7ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:38:39,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:38:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:38:39,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:39,111 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:39,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1328413483, now seen corresponding path program 1 times [2025-03-03 19:38:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244274886] [2025-03-03 19:38:39,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:39,124 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-03 19:38:39,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:39,129 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-03 19:38:39,130 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-03 19:38:39,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:38:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:38:39,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:39,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:38:39,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2025-03-03 19:38:39,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:39,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:38:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244274886] [2025-03-03 19:38:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244274886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:38:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810374229] [2025-03-03 19:38:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:38:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:38:39,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:38:39,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:38:39,435 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:38:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:39,452 INFO L93 Difference]: Finished difference Result 150 states and 263 transitions. [2025-03-03 19:38:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:38:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2025-03-03 19:38:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:39,458 INFO L225 Difference]: With dead ends: 150 [2025-03-03 19:38:39,458 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 19:38:39,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-03 19:38:39,462 INFO L435 NwaCegarLoop]: 115 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, 115 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-03 19:38:39,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:38:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 19:38:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 19:38:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2025-03-03 19:38:39,499 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 176 [2025-03-03 19:38:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2025-03-03 19:38:39,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:38:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2025-03-03 19:38:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:38:39,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:39,502 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:39,510 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 19:38:39,702 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-03 19:38:39,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:39,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2061728619, now seen corresponding path program 1 times [2025-03-03 19:38:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327652105] [2025-03-03 19:38:39,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:39,704 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-03 19:38:39,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:39,707 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-03 19:38:39,708 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-03 19:38:39,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:38:39,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:38:39,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:39,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:38:39,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:40,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:40,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:38:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327652105] [2025-03-03 19:38:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327652105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:38:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228676811] [2025-03-03 19:38:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:40,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:38:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:38:40,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:38:40,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:38:40,360 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:40,805 INFO L93 Difference]: Finished difference Result 236 states and 364 transitions. [2025-03-03 19:38:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:38:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-03 19:38:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:40,816 INFO L225 Difference]: With dead ends: 236 [2025-03-03 19:38:40,817 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 19:38:40,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:38:40,818 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 90 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:40,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 404 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:38:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 19:38:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2025-03-03 19:38:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 19:38:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2025-03-03 19:38:40,845 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 176 [2025-03-03 19:38:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:40,846 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2025-03-03 19:38:40,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2025-03-03 19:38:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:38:40,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:40,850 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:40,858 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 (3)] Ended with exit code 0 [2025-03-03 19:38:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-03 19:38:41,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash -554176810, now seen corresponding path program 1 times [2025-03-03 19:38:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503847854] [2025-03-03 19:38:41,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:41,052 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-03 19:38:41,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:41,055 INFO L229 MonitoredProcess]: Starting monitored process 4 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-03 19:38:41,056 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 (4)] Waiting until timeout for monitored process [2025-03-03 19:38:41,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:38:41,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:38:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:41,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:38:41,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:38:41,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:41,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:38:41,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503847854] [2025-03-03 19:38:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503847854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:41,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:38:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747290956] [2025-03-03 19:38:41,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:38:41,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:38:41,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:38:41,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:38:41,624 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:41,967 INFO L93 Difference]: Finished difference Result 147 states and 226 transitions. [2025-03-03 19:38:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:38:41,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-03 19:38:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:41,978 INFO L225 Difference]: With dead ends: 147 [2025-03-03 19:38:41,978 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 19:38:41,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 173 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-03 19:38:41,979 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:41,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:38:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 19:38:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 19:38:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:38:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2025-03-03 19:38:41,995 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 176 [2025-03-03 19:38:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:41,995 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2025-03-03 19:38:41,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:38:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2025-03-03 19:38:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:38:41,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:41,998 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:38:42,007 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 (4)] Ended with exit code 0 [2025-03-03 19:38:42,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-03 19:38:42,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1943839127, now seen corresponding path program 1 times [2025-03-03 19:38:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853310078] [2025-03-03 19:38:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:42,200 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-03 19:38:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:42,204 INFO L229 MonitoredProcess]: Starting monitored process 5 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-03 19:38:42,205 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 (5)] Waiting until timeout for monitored process [2025-03-03 19:38:42,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:38:42,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:38:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 19:38:42,402 INFO L279 TraceCheckSpWp]: Computing forward predicates...