./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:51:38,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:51:38,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:51:38,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:51:38,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:51:38,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:51:38,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:51:38,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:51:38,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:51:38,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:51:38,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:51:38,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:51:38,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:51:38,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:51:38,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:51:38,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:51:38,255 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 [2025-03-16 23:51:38,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:51:38,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:51:38,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:51:38,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:51:38,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:51:38,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:51:39,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9041a2858/5914b68754024695b315b991a5b0387b/FLAG8da3b16b7 [2025-03-16 23:51:39,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:51:39,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:51:39,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9041a2858/5914b68754024695b315b991a5b0387b/FLAG8da3b16b7 [2025-03-16 23:51:40,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9041a2858/5914b68754024695b315b991a5b0387b [2025-03-16 23:51:40,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:51:40,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:51:40,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:51:40,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:51:40,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:51:40,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40, skipping insertion in model container [2025-03-16 23:51:40,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:51:40,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i[914,927] [2025-03-16 23:51:40,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:51:40,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:51:40,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i[914,927] [2025-03-16 23:51:40,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:51:40,475 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:51:40,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40 WrapperNode [2025-03-16 23:51:40,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:51:40,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:51:40,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:51:40,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:51:40,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,504 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-03-16 23:51:40,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:51:40,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:51:40,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:51:40,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:51:40,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:51:40,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:51:40,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:51:40,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:51:40,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:51:40,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (1/1) ... [2025-03-16 23:51:40,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:51:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:51:40,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:51:40,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:51:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:51:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:51:40,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:51:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:51:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:51:40,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:51:40,640 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:51:40,642 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:51:40,830 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-16 23:51:40,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:51:40,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:51:40,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:51:40,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:51:40 BoogieIcfgContainer [2025-03-16 23:51:40,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:51:40,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:51:40,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:51:40,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:51:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:51:40" (1/3) ... [2025-03-16 23:51:40,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72645a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:51:40, skipping insertion in model container [2025-03-16 23:51:40,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:40" (2/3) ... [2025-03-16 23:51:40,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72645a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:51:40, skipping insertion in model container [2025-03-16 23:51:40,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:51:40" (3/3) ... [2025-03-16 23:51:40,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:51:40,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:51:40,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:51:40,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:51:40,915 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;@4180be87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:51:40,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:51:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:51:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:51:40,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:40,929 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:40,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash -4726621, now seen corresponding path program 1 times [2025-03-16 23:51:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:51:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95783620] [2025-03-16 23:51:40,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:51:41,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:51:41,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:51:41,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:41,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:51:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:51:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95783620] [2025-03-16 23:51:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95783620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:51:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421789814] [2025-03-16 23:51:41,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:41,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:51:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:51:41,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:51:41,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:51:41,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:51:41,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:51:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:41,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:41,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:51:41,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-16 23:51:41,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:51:41,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421789814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:51:41,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:51:41,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:51:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835211121] [2025-03-16 23:51:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:51:41,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:51:41,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:51:41,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:51:41,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:51:41,399 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:51:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:41,423 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2025-03-16 23:51:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:51:41,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-16 23:51:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:41,429 INFO L225 Difference]: With dead ends: 121 [2025-03-16 23:51:41,429 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 23:51:41,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:51:41,436 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:41,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:51:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 23:51:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-16 23:51:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:51:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-03-16 23:51:41,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-03-16 23:51:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-03-16 23:51:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:51:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-03-16 23:51:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 23:51:41,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:41,471 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:41,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:51:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:51:41,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:41,676 INFO L85 PathProgramCache]: Analyzing trace with hash -852913344, now seen corresponding path program 1 times [2025-03-16 23:51:41,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:51:41,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-03-16 23:51:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:51:41,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 23:51:41,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 23:51:41,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:41,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:51:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292245851] [2025-03-16 23:51:41,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:41,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:51:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:51:41,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:51:41,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:51:41,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 23:51:42,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 23:51:42,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:42,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:42,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 23:51:42,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 406 proven. 30 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-16 23:51:42,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:51:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-16 23:51:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:51:42,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-03-16 23:51:42,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:51:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292245851] [2025-03-16 23:51:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292245851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:51:42,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:51:42,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 23:51:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640072838] [2025-03-16 23:51:42,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:51:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:51:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:51:42,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:51:42,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:51:42,958 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-16 23:51:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:43,309 INFO L93 Difference]: Finished difference Result 146 states and 211 transitions. [2025-03-16 23:51:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:51:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) Word has length 130 [2025-03-16 23:51:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:43,311 INFO L225 Difference]: With dead ends: 146 [2025-03-16 23:51:43,311 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 23:51:43,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:51:43,312 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 122 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:43,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 207 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:51:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 23:51:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-16 23:51:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.196078431372549) internal successors, (61), 52 states have internal predecessors, (61), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:51:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-16 23:51:43,328 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 130 [2025-03-16 23:51:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-16 23:51:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-16 23:51:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-16 23:51:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 23:51:43,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:43,333 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:43,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:51:43,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-16 23:51:43,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:43,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1013754535, now seen corresponding path program 1 times [2025-03-16 23:51:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:51:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684506018] [2025-03-16 23:51:43,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:51:43,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 23:51:43,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 23:51:43,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:51:43,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711664376] [2025-03-16 23:51:43,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:43,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:51:43,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:51:43,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:51:43,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:51:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 23:51:43,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 23:51:43,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:43,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:51:43,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:51:43,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 23:51:43,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 23:51:43,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:43,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:51:43,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:51:43,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:51:43,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:51:43,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:51:44,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:51:44,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:51:44,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:51:44,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:51:44 BoogieIcfgContainer [2025-03-16 23:51:44,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:51:44,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:51:44,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:51:44,244 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:51:44,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:51:40" (3/4) ... [2025-03-16 23:51:44,246 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:51:44,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:51:44,248 INFO L158 Benchmark]: Toolchain (without parser) took 4017.23ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 83.3MB in the end (delta: 29.6MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2025-03-16 23:51:44,248 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:51:44,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 98.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:51:44,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:51:44,249 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:51:44,249 INFO L158 Benchmark]: IcfgBuilder took 309.04ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 75.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:51:44,249 INFO L158 Benchmark]: TraceAbstraction took 3398.03ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 83.4MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:51:44,249 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:51:44,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.05ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 98.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.04ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 75.5MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3398.03ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 83.4MB in the end (delta: -8.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 24.1kB). 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 someBinaryArithmeticDOUBLEoperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] float var_1_23 = 64.9; [L41] signed long int var_1_24 = 10000; [L42] signed long int var_1_25 = -128; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_27 = 2; [L45] unsigned char var_1_28 = 0; [L46] unsigned char var_1_29 = 1; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int last_1_var_1_6 = 10000; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] last_1_var_1_6 = var_1_6 [L151] RET updateLastVariables() [L152] CALL updateVariables() [L106] var_1_4 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L107] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L108] var_1_5 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L109] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000, var_1_8=129/2] [L110] var_1_8 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L111] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L113] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L114] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L114] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L115] var_1_12 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L116] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L117] var_1_13 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L118] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L119] var_1_15 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L120] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L121] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L121] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L122] var_1_16 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L124] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L124] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L125] var_1_18 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L126] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L127] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L127] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_23=649/10, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L129] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=-128, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L130] var_1_25 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L131] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L132] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L132] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=2, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L133] var_1_27 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L134] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L135] CALL assume_abort_if_not(var_1_27 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L135] RET assume_abort_if_not(var_1_27 <= 32) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=0, var_1_29=1, var_1_30=100, var_1_6=10000] [L136] var_1_28 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L137] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L138] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L138] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_24=10000, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L152] RET updateVariables() [L153] CALL step() [L52] var_1_22 = var_1_23 [L53] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L54] EXPR ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) >> ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L54] COND TRUE (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) >> ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < 25 [L55] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=100, var_1_6=10000] [L57] var_1_29 = var_1_28 [L58] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_6=10000] [L59] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L60] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_6=10000] [L62] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L63] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L67] var_1_20 = var_1_16 [L68] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L69] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L70] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L71] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L78] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=10000] [L79] COND FALSE !(\read(var_1_17)) [L90] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=1] [L92] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_6=1] [L93] COND FALSE !(var_1_6 > var_1_6) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L101] COND TRUE var_1_1 < var_1_11 [L102] var_1_19 = (var_1_13 - 256.4) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L153] RET step() [L154] CALL, EXPR property() [L144-L145] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=4, var_1_12=3, var_1_14=3, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=1, var_1_22=2, var_1_23=2, var_1_24=24, var_1_25=24, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=0, var_1_4=0, var_1_5=5, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 165 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 3 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2942/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:51:44,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:51:46,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:51:46,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:51:46,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:51:46,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:51:46,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:51:46,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:51:46,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:51:46,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:51:46,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:51:46,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:51:46,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:51:46,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:51:46,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:51:46,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:51:46,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:51:46,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:51:46,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:51:46,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:51:46,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:51:46,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:51:46,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:51:46,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:51:46,182 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:51:46,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68b5d0c2417a30286d2430420175a6ba06d2b35ef6e8f5490a75730b028e0582 [2025-03-16 23:51:46,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:51:46,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:51:46,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:51:46,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:51:46,439 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:51:46,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:51:47,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e846289/3e1ce88d70b040efba987268e0766ae4/FLAG0fbff4d3b [2025-03-16 23:51:47,778 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:51:47,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:51:47,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e846289/3e1ce88d70b040efba987268e0766ae4/FLAG0fbff4d3b [2025-03-16 23:51:47,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e846289/3e1ce88d70b040efba987268e0766ae4 [2025-03-16 23:51:47,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:51:47,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:51:47,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:51:47,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:51:47,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:51:47,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:51:47" (1/1) ... [2025-03-16 23:51:47,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb45ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:47, skipping insertion in model container [2025-03-16 23:51:47,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:51:47" (1/1) ... [2025-03-16 23:51:47,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:51:47,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i[914,927] [2025-03-16 23:51:47,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:51:48,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:51:48,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-2.i[914,927] [2025-03-16 23:51:48,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:51:48,063 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:51:48,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48 WrapperNode [2025-03-16 23:51:48,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:51:48,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:51:48,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:51:48,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:51:48,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,098 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-16 23:51:48,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:51:48,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:51:48,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:51:48,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:51:48,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:51:48,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:51:48,128 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:51:48,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:51:48,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:51:48,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (1/1) ... [2025-03-16 23:51:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:51:48,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:51:48,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:51:48,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:51:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:51:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:51:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:51:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:51:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:51:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:51:48,249 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:51:48,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:52:03,300 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-16 23:52:03,300 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:52:03,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:52:03,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:52:03,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:03 BoogieIcfgContainer [2025-03-16 23:52:03,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:52:03,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:52:03,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:52:03,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:52:03,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:51:47" (1/3) ... [2025-03-16 23:52:03,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb00d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:03, skipping insertion in model container [2025-03-16 23:52:03,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:51:48" (2/3) ... [2025-03-16 23:52:03,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb00d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:52:03, skipping insertion in model container [2025-03-16 23:52:03,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:52:03" (3/3) ... [2025-03-16 23:52:03,317 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i [2025-03-16 23:52:03,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:52:03,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-2.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:52:03,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:52:03,370 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;@2d221886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:52:03,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:52:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:52:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 23:52:03,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:03,382 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:03,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash 904929281, now seen corresponding path program 1 times [2025-03-16 23:52:03,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108171618] [2025-03-16 23:52:03,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:52:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:03,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:52:03,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 23:52:03,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 23:52:03,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 23:52:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:03,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:52:04,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 23:52:04,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:52:04,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108171618] [2025-03-16 23:52:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108171618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:52:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:52:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:52:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186447472] [2025-03-16 23:52:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:52:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:52:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:04,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:52:04,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:52:04,050 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:52:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:04,066 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2025-03-16 23:52:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:52:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-16 23:52:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:04,073 INFO L225 Difference]: With dead ends: 117 [2025-03-16 23:52:04,073 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 23:52:04,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:52:04,077 INFO L435 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:04,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:52:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 23:52:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 23:52:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 23:52:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-16 23:52:04,106 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 128 [2025-03-16 23:52:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:04,107 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-16 23:52:04,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 23:52:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-16 23:52:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 23:52:04,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:04,110 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:04,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:52:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:52:04,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:04,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1173048538, now seen corresponding path program 1 times [2025-03-16 23:52:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75348280] [2025-03-16 23:52:04,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:52:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:04,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:52:04,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 23:52:04,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 23:52:04,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 23:52:04,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:04,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:04,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:52:04,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-16 23:52:06,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:52:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-16 23:52:07,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:52:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75348280] [2025-03-16 23:52:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75348280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:52:07,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:52:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-16 23:52:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465286051] [2025-03-16 23:52:07,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:52:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:52:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:52:07,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:52:07,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:52:07,549 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:52:10,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:14,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:18,711 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-03-16 23:52:22,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:52:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:52:23,611 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2025-03-16 23:52:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:52:23,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 129 [2025-03-16 23:52:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:52:23,613 INFO L225 Difference]: With dead ends: 144 [2025-03-16 23:52:23,613 INFO L226 Difference]: Without dead ends: 87 [2025-03-16 23:52:23,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:52:23,615 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 116 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:52:23,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 180 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 228 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2025-03-16 23:52:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-16 23:52:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2025-03-16 23:52:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:52:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-16 23:52:23,633 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 129 [2025-03-16 23:52:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:52:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-16 23:52:23,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:52:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-16 23:52:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 23:52:23,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:52:23,635 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:52:23,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 23:52:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:52:23,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:52:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:52:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -320501887, now seen corresponding path program 1 times [2025-03-16 23:52:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:52:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506177482] [2025-03-16 23:52:23,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:52:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:52:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:52:23,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:52:23,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:52:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 23:52:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 23:52:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:52:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:52:24,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 23:52:24,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:54,734 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:53:02,883 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:53:11,040 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:53:19,192 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)