./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d932f550128ee0fa0e71186b284b0166975f000099ce0256890ee3ed041af704 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:40:46,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:40:46,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:40:46,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:40:46,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:40:46,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:40:46,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:40:46,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:40:46,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:40:46,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:40:46,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:40:46,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:40:46,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:40:46,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:40:46,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:40:46,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:40:46,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:40:46,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:40:46,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:40:46,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:40:46,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:40:46,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:40:46,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:40:46,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:40:46,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:40:46,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d932f550128ee0fa0e71186b284b0166975f000099ce0256890ee3ed041af704 [2025-02-05 20:40:46,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:40:46,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:40:46,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:40:46,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:40:46,859 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:40:46,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i [2025-02-05 20:40:48,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58452ac4f/6ccadcbcf5e443798c491c125e18eade/FLAG22b7cc57a [2025-02-05 20:40:48,433 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:40:48,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i [2025-02-05 20:40:48,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58452ac4f/6ccadcbcf5e443798c491c125e18eade/FLAG22b7cc57a [2025-02-05 20:40:48,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58452ac4f/6ccadcbcf5e443798c491c125e18eade [2025-02-05 20:40:48,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:40:48,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:40:48,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:40:48,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:40:48,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:40:48,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33adb83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48, skipping insertion in model container [2025-02-05 20:40:48,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:40:48,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i[913,926] [2025-02-05 20:40:48,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:40:48,649 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:40:48,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i[913,926] [2025-02-05 20:40:48,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:40:48,706 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:40:48,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48 WrapperNode [2025-02-05 20:40:48,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:40:48,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:40:48,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:40:48,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:40:48,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,755 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-02-05 20:40:48,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:40:48,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:40:48,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:40:48,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:40:48,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:40:48,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:40:48,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:40:48,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:40:48,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:40:48,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (1/1) ... [2025-02-05 20:40:48,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:40:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:40:48,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:40:48,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:40:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:40:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:40:48,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:40:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:40:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:40:48,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:40:48,946 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:40:48,948 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:40:49,381 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-02-05 20:40:49,438 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 20:40:49,438 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:40:49,465 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:40:49,465 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:40:49,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:40:49 BoogieIcfgContainer [2025-02-05 20:40:49,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:40:49,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:40:49,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:40:49,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:40:49,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:40:48" (1/3) ... [2025-02-05 20:40:49,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531881e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:40:49, skipping insertion in model container [2025-02-05 20:40:49,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:40:48" (2/3) ... [2025-02-05 20:40:49,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531881e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:40:49, skipping insertion in model container [2025-02-05 20:40:49,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:40:49" (3/3) ... [2025-02-05 20:40:49,476 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-88.i [2025-02-05 20:40:49,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:40:49,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-88.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:40:49,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:40:49,570 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;@365c285c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:40:49,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:40:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:40:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:40:49,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:40:49,589 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:40:49,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:40:49,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:40:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -569595063, now seen corresponding path program 1 times [2025-02-05 20:40:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:40:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152133120] [2025-02-05 20:40:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:40:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:49,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:49,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:40:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 20:40:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:40:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152133120] [2025-02-05 20:40:49,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152133120] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:40:49,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67389656] [2025-02-05 20:40:49,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:49,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:40:49,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:40:49,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:40:50,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:50,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:40:50,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:40:50,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:40:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-02-05 20:40:50,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:40:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67389656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:40:50,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:40:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:40:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31197680] [2025-02-05 20:40:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:40:50,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:40:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:40:50,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:40:50,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:40:50,226 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:40:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:40:50,259 INFO L93 Difference]: Finished difference Result 182 states and 319 transitions. [2025-02-05 20:40:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:40:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-02-05 20:40:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:40:50,271 INFO L225 Difference]: With dead ends: 182 [2025-02-05 20:40:50,272 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 20:40:50,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:40:50,280 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:40:50,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:40:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 20:40:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 20:40:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:40:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2025-02-05 20:40:50,337 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 196 [2025-02-05 20:40:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:40:50,338 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2025-02-05 20:40:50,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:40:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2025-02-05 20:40:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:40:50,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:40:50,343 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:40:50,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:40:50,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:40:50,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:40:50,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:40:50,545 INFO L85 PathProgramCache]: Analyzing trace with hash -574920217, now seen corresponding path program 1 times [2025-02-05 20:40:50,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:40:50,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267429973] [2025-02-05 20:40:50,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:40:50,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:50,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:40:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 20:40:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:40:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267429973] [2025-02-05 20:40:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267429973] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:40:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198027175] [2025-02-05 20:40:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:40:51,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:40:51,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:40:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:51,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:51,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:51,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:40:51,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 20:40:51,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:40:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 20:40:51,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:40:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 20:40:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198027175] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:40:52,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:40:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 20:40:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869050698] [2025-02-05 20:40:52,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:40:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:40:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:40:52,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:40:52,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:40:52,093 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 20:40:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:40:52,358 INFO L93 Difference]: Finished difference Result 187 states and 286 transitions. [2025-02-05 20:40:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:40:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 196 [2025-02-05 20:40:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:40:52,363 INFO L225 Difference]: With dead ends: 187 [2025-02-05 20:40:52,363 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 20:40:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:40:52,368 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 68 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:40:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 234 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:40:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 20:40:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-02-05 20:40:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:40:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2025-02-05 20:40:52,392 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 196 [2025-02-05 20:40:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:40:52,393 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2025-02-05 20:40:52,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 20:40:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2025-02-05 20:40:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:40:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:40:52,396 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:40:52,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:40:52,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:52,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:40:52,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:40:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1912592616, now seen corresponding path program 1 times [2025-02-05 20:40:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:40:52,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126750243] [2025-02-05 20:40:52,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:40:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:40:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2062436404] [2025-02-05 20:40:52,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:52,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:40:52,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:40:52,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:40:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:52,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:40:52,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 20:40:52,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:40:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 981 proven. 36 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2025-02-05 20:40:53,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:40:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:40:54,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126750243] [2025-02-05 20:40:54,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 20:40:54,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062436404] [2025-02-05 20:40:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062436404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:40:54,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:40:54,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-02-05 20:40:54,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244513543] [2025-02-05 20:40:54,131 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 20:40:54,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:40:54,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:40:54,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:40:54,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:40:54,133 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:40:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:40:54,455 INFO L93 Difference]: Finished difference Result 289 states and 432 transitions. [2025-02-05 20:40:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:40:54,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-02-05 20:40:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:40:54,461 INFO L225 Difference]: With dead ends: 289 [2025-02-05 20:40:54,462 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 20:40:54,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:40:54,463 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:40:54,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 476 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:40:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 20:40:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-02-05 20:40:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-05 20:40:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 282 transitions. [2025-02-05 20:40:54,517 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 282 transitions. Word has length 196 [2025-02-05 20:40:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:40:54,519 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 282 transitions. [2025-02-05 20:40:54,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:40:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2025-02-05 20:40:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 20:40:54,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:40:54,524 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:40:54,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:40:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:54,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:40:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:40:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1716079111, now seen corresponding path program 1 times [2025-02-05 20:40:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:40:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575689317] [2025-02-05 20:40:54,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:40:54,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:40:54,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188614698] [2025-02-05 20:40:54,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:40:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:40:54,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:40:54,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:40:54,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:54,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:54,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:54,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:40:54,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:40:55,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 20:40:55,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 20:40:55,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:40:55,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:40:55,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:40:55,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:40:55,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:40:55,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:40:55,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:40:55,372 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 20:40:55,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:40:55,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:40:55 BoogieIcfgContainer [2025-02-05 20:40:55,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:40:55,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:40:55,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:40:55,497 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:40:55,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:40:49" (3/4) ... [2025-02-05 20:40:55,499 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:40:55,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:40:55,501 INFO L158 Benchmark]: Toolchain (without parser) took 7044.79ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 107.6MB in the beginning and 225.8MB in the end (delta: -118.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-02-05 20:40:55,501 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:40:55,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.89ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 92.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:40:55,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.17ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:40:55,503 INFO L158 Benchmark]: Boogie Preprocessor took 68.91ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:40:55,503 INFO L158 Benchmark]: IcfgBuilder took 640.46ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 56.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:40:55,503 INFO L158 Benchmark]: TraceAbstraction took 6026.59ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.8MB in the beginning and 225.9MB in the end (delta: -170.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:40:55,503 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 302.0MB. Free memory was 225.9MB in the beginning and 225.8MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:40:55,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.89ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 92.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.17ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.91ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 640.46ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 56.8MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6026.59ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.8MB in the beginning and 225.9MB in the end (delta: -170.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 302.0MB. Free memory was 225.9MB in the beginning and 225.8MB in the end (delta: 87.7kB). 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] unsigned char var_1_3 = 1; [L25] float var_1_4 = 127.6; [L26] double var_1_5 = 100000000000000.5; [L27] double var_1_6 = 100000000000000.7; [L28] double var_1_7 = 256.75; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 1; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] signed char var_1_12 = 0; [L34] signed char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 16; [L37] unsigned char var_1_16 = 10; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 4; [L40] unsigned char var_1_19 = 8; [L41] unsigned char var_1_20 = 8; [L42] unsigned short int var_1_21 = 128; [L43] unsigned char var_1_22 = 0; [L44] unsigned short int var_1_23 = 100; [L45] unsigned short int var_1_24 = 34649; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_2=19/2, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] FCALL updateLastVariables() [L157] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L97] var_1_3 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=16, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=10, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L123] var_1_16 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L126] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_17=5, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L127] var_1_17 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L129] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L130] var_1_18 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L132] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L133] var_1_19 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L136] var_1_20 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_23=100, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L139] var_1_23 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_3=1, var_1_8=0, var_1_9=1] [L142] var_1_24 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L157] RET updateVariables() [L158] CALL step() [L49] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L60] COND FALSE !(var_1_1 > ((var_1_4 * var_1_5) + 5.3)) [L67] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L69] COND FALSE !(((- var_1_4) / 24.75) < var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L76] COND FALSE !(var_1_15 < ((var_1_12 / var_1_16) * var_1_17)) [L79] var_1_14 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L81] COND FALSE !(var_1_3 && var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L84] EXPR var_1_18 << var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L84] COND FALSE !(var_1_19 == (var_1_18 << var_1_15)) [L91] var_1_22 = 64 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L158] RET step() [L159] CALL, EXPR property() [L149] EXPR ((((((64.5f <= var_1_2) ? (var_1_3 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_4 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_4) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_4) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_4) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((var_1_15 < ((var_1_12 / var_1_16) * var_1_17)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_3 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_15)) ? ((var_1_23 >= ((var_1_15 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L149-L150] return ((((((64.5f <= var_1_2) ? (var_1_3 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_4 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_4) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_4) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_4) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((var_1_15 < ((var_1_12 / var_1_16) * var_1_17)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_3 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_15)) ? ((var_1_23 >= ((var_1_15 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_3=1, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 4, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 847 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 509 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 338 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 791 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2879 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1245 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 11617/11904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:40:55,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d932f550128ee0fa0e71186b284b0166975f000099ce0256890ee3ed041af704 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:40:57,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:40:57,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:40:57,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:40:57,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:40:57,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:40:57,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:40:57,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:40:57,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:40:57,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:40:57,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:40:57,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:40:57,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:40:57,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:40:57,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:40:57,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:40:57,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:40:57,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:40:57,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d932f550128ee0fa0e71186b284b0166975f000099ce0256890ee3ed041af704 [2025-02-05 20:40:58,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:40:58,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:40:58,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:40:58,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:40:58,199 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:40:58,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i [2025-02-05 20:40:59,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69ccb3f8c/759b84a3f76b43469b06cf9411d3b269/FLAG92eef685e [2025-02-05 20:40:59,800 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:40:59,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i [2025-02-05 20:40:59,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69ccb3f8c/759b84a3f76b43469b06cf9411d3b269/FLAG92eef685e [2025-02-05 20:41:00,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69ccb3f8c/759b84a3f76b43469b06cf9411d3b269 [2025-02-05 20:41:00,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:41:00,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:41:00,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:41:00,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:41:00,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:41:00,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ea14cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00, skipping insertion in model container [2025-02-05 20:41:00,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:41:00,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i[913,926] [2025-02-05 20:41:00,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:41:00,332 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:41:00,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-88.i[913,926] [2025-02-05 20:41:00,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:41:00,381 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:41:00,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00 WrapperNode [2025-02-05 20:41:00,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:41:00,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:41:00,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:41:00,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:41:00,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,446 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-02-05 20:41:00,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:41:00,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:41:00,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:41:00,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:41:00,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:41:00,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:41:00,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:41:00,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:41:00,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:41:00,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (1/1) ... [2025-02-05 20:41:00,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:41:00,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:41:00,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:41:00,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:41:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:41:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:41:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:41:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:41:00,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:41:00,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:41:00,655 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:41:00,657 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:41:22,487 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-05 20:41:22,488 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:41:22,503 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:41:22,503 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:41:22,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:41:22 BoogieIcfgContainer [2025-02-05 20:41:22,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:41:22,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:41:22,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:41:22,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:41:22,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:41:00" (1/3) ... [2025-02-05 20:41:22,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd95819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:41:22, skipping insertion in model container [2025-02-05 20:41:22,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:41:00" (2/3) ... [2025-02-05 20:41:22,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd95819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:41:22, skipping insertion in model container [2025-02-05 20:41:22,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:41:22" (3/3) ... [2025-02-05 20:41:22,517 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-88.i [2025-02-05 20:41:22,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:41:22,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-88.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:41:22,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:41:22,598 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;@6daf3762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:41:22,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:41:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:41:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 20:41:22,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:41:22,613 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:41:22,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:41:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:41:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -606486308, now seen corresponding path program 1 times [2025-02-05 20:41:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:41:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394865260] [2025-02-05 20:41:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:41:22,628 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-02-05 20:41:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:41:22,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 20:41:22,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:41:22,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 20:41:23,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 20:41:23,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:41:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:41:23,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:41:23,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:41:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-02-05 20:41:23,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:41:23,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:41:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394865260] [2025-02-05 20:41:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394865260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:41:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:41:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:41:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38039784] [2025-02-05 20:41:23,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:41:23,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:41:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:41:23,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:41:23,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:41:23,403 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:41:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:41:23,437 INFO L93 Difference]: Finished difference Result 152 states and 273 transitions. [2025-02-05 20:41:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:41:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 193 [2025-02-05 20:41:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:41:23,444 INFO L225 Difference]: With dead ends: 152 [2025-02-05 20:41:23,444 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 20:41:23,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:41:23,449 INFO L435 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:41:23,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:41:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 20:41:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-05 20:41:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:41:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 118 transitions. [2025-02-05 20:41:23,504 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 118 transitions. Word has length 193 [2025-02-05 20:41:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:41:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 118 transitions. [2025-02-05 20:41:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 20:41:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 118 transitions. [2025-02-05 20:41:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 20:41:23,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:41:23,509 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:41:23,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 20:41:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 20:41:23,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:41:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:41:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1066317566, now seen corresponding path program 1 times [2025-02-05 20:41:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:41:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891075193] [2025-02-05 20:41:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:41:23,712 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-02-05 20:41:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:41:23,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 20:41:23,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:41:23,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 20:41:24,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 20:41:24,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:41:24,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:41:24,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 20:41:24,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:41:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 20:41:27,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:41:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-02-05 20:41:31,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:41:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891075193] [2025-02-05 20:41:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891075193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:41:31,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:41:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 20:41:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112020983] [2025-02-05 20:41:31,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:41:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:41:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:41:31,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:41:31,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:41:31,123 INFO L87 Difference]: Start difference. First operand 76 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 20:41:38,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:41:42,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:41:46,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 20:41:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:41:46,703 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2025-02-05 20:41:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:41:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 193 [2025-02-05 20:41:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:41:46,792 INFO L225 Difference]: With dead ends: 157 [2025-02-05 20:41:46,792 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 20:41:46,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:41:46,794 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:41:46,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 177 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-02-05 20:41:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 20:41:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-02-05 20:41:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 20:41:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2025-02-05 20:41:46,815 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 193 [2025-02-05 20:41:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:41:46,816 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2025-02-05 20:41:46,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 20:41:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2025-02-05 20:41:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 20:41:46,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:41:46,820 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:41:46,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:41:47,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 20:41:47,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:41:47,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:41:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1094946717, now seen corresponding path program 1 times [2025-02-05 20:41:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:41:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467781379] [2025-02-05 20:41:47,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:41:47,022 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-02-05 20:41:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:41:47,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 20:41:47,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:41:47,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 20:41:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 20:41:47,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:41:47,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:41:47,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 20:41:47,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:41:59,206 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:42:07,338 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:42:15,475 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 20:42:23,572 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)