./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:52:39,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:52:39,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:52:39,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:52:39,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:52:39,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:52:39,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:52:39,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:52:39,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:52:39,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:52:39,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:52:39,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:52:39,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:52:39,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:52:39,514 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:52:39,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:52:39,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:52:39,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:52:39,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:52:39,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:52:39,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:39,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:39,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:39,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:52:39,517 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2025-01-09 09:52:39,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:52:39,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:52:39,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:52:39,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:52:39,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:52:39,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:52:41,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6015ee5/25c6bbf9eeed4fb6af37b11055ceceac/FLAG958b4dcf5 [2025-01-09 09:52:41,485 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:52:41,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:52:41,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6015ee5/25c6bbf9eeed4fb6af37b11055ceceac/FLAG958b4dcf5 [2025-01-09 09:52:41,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6015ee5/25c6bbf9eeed4fb6af37b11055ceceac [2025-01-09 09:52:41,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:52:41,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:52:41,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:41,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:52:41,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:52:41,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:41,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bd455a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41, skipping insertion in model container [2025-01-09 09:52:41,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:41,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:52:41,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-01-09 09:52:41,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:41,930 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:52:41,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-01-09 09:52:41,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:41,971 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:52:41,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41 WrapperNode [2025-01-09 09:52:41,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:41,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:41,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:52:41,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:52:41,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:41,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,014 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2025-01-09 09:52:42,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:42,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:52:42,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:52:42,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:52:42,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,040 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-01-09 09:52:42,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:52:42,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:52:42,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:52:42,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:52:42,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (1/1) ... [2025-01-09 09:52:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:42,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:52:42,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:52:42,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:52:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:52:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:52:42,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:52:42,157 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:52:42,158 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:52:42,611 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:52:42,611 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:52:42,631 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:52:42,631 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:52:42,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:52:42 BoogieIcfgContainer [2025-01-09 09:52:42,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:52:42,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:52:42,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:52:42,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:52:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:52:41" (1/3) ... [2025-01-09 09:52:42,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c67a27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:52:42, skipping insertion in model container [2025-01-09 09:52:42,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:41" (2/3) ... [2025-01-09 09:52:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c67a27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:52:42, skipping insertion in model container [2025-01-09 09:52:42,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:52:42" (3/3) ... [2025-01-09 09:52:42,653 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:52:42,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:52:42,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:52:42,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:52:42,777 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;@19f787a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:52:42,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:52:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:52:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:52:42,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:42,795 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:42,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash 735398819, now seen corresponding path program 1 times [2025-01-09 09:52:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612829888] [2025-01-09 09:52:42,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:42,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:52:42,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:52:42,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:42,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 09:52:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612829888] [2025-01-09 09:52:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612829888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:52:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404301552] [2025-01-09 09:52:43,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:43,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:52:43,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:52:43,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:52:43,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:52:43,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:43,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:52:43,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:52:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 09:52:43,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:52:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404301552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:52:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:52:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097823581] [2025-01-09 09:52:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:43,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:52:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:43,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:52:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:52:43,355 INFO L87 Difference]: Start difference. First operand has 105 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:43,382 INFO L93 Difference]: Finished difference Result 204 states and 357 transitions. [2025-01-09 09:52:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:52:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2025-01-09 09:52:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:43,389 INFO L225 Difference]: With dead ends: 204 [2025-01-09 09:52:43,389 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 09:52:43,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:52:43,394 INFO L435 NwaCegarLoop]: 161 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, 161 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-01-09 09:52:43,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:52:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 09:52:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 09:52:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:52:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2025-01-09 09:52:43,433 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 181 [2025-01-09 09:52:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:43,433 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2025-01-09 09:52:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2025-01-09 09:52:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:52:43,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:43,436 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:43,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:52:43,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:52:43,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1717629927, now seen corresponding path program 1 times [2025-01-09 09:52:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85919333] [2025-01-09 09:52:43,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:43,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:43,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:52:43,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:52:43,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85919333] [2025-01-09 09:52:44,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85919333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:44,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:52:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673647359] [2025-01-09 09:52:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:52:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:44,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:52:44,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,028 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:44,083 INFO L93 Difference]: Finished difference Result 300 states and 477 transitions. [2025-01-09 09:52:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:52:44,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2025-01-09 09:52:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:44,088 INFO L225 Difference]: With dead ends: 300 [2025-01-09 09:52:44,088 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 09:52:44,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,089 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 96 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:44,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 297 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:52:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 09:52:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-01-09 09:52:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:52:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 314 transitions. [2025-01-09 09:52:44,129 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 314 transitions. Word has length 181 [2025-01-09 09:52:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:44,130 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 314 transitions. [2025-01-09 09:52:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 314 transitions. [2025-01-09 09:52:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 09:52:44,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:44,134 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:44,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:52:44,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:44,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2077104275, now seen corresponding path program 1 times [2025-01-09 09:52:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174973905] [2025-01-09 09:52:44,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:44,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 09:52:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 09:52:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174973905] [2025-01-09 09:52:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174973905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:44,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:52:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820799154] [2025-01-09 09:52:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:52:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:44,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:52:44,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,310 INFO L87 Difference]: Start difference. First operand 199 states and 314 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:44,430 INFO L93 Difference]: Finished difference Result 583 states and 926 transitions. [2025-01-09 09:52:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:52:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2025-01-09 09:52:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:44,438 INFO L225 Difference]: With dead ends: 583 [2025-01-09 09:52:44,439 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 09:52:44,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,441 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:44,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 434 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:52:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 09:52:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2025-01-09 09:52:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 268 states have (on average 1.4328358208955223) internal successors, (384), 268 states have internal predecessors, (384), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 09:52:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2025-01-09 09:52:44,509 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 182 [2025-01-09 09:52:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:44,510 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2025-01-09 09:52:44,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2025-01-09 09:52:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 09:52:44,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:44,513 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:44,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:52:44,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1041825261, now seen corresponding path program 1 times [2025-01-09 09:52:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236637827] [2025-01-09 09:52:44,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 09:52:44,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 09:52:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:44,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236637827] [2025-01-09 09:52:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236637827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:44,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:52:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472760369] [2025-01-09 09:52:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:52:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:44,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:52:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,668 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:44,749 INFO L93 Difference]: Finished difference Result 885 states and 1386 transitions. [2025-01-09 09:52:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:52:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2025-01-09 09:52:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:44,757 INFO L225 Difference]: With dead ends: 885 [2025-01-09 09:52:44,757 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 09:52:44,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:44,760 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 43 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:44,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 334 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:52:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 09:52:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 421. [2025-01-09 09:52:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 304 states have (on average 1.4342105263157894) internal successors, (436), 304 states have internal predecessors, (436), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 09:52:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 660 transitions. [2025-01-09 09:52:44,823 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 660 transitions. Word has length 182 [2025-01-09 09:52:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 660 transitions. [2025-01-09 09:52:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 660 transitions. [2025-01-09 09:52:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 09:52:44,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:44,827 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:52:44,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 625171339, now seen corresponding path program 1 times [2025-01-09 09:52:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927067881] [2025-01-09 09:52:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:44,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:52:44,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:52:44,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:44,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 09:52:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:45,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927067881] [2025-01-09 09:52:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927067881] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:52:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092363325] [2025-01-09 09:52:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:45,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:45,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:52:45,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:52:45,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:52:45,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:52:45,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:45,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:45,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 09:52:45,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:52:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 880 proven. 246 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-01-09 09:52:47,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:52:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 111 proven. 195 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-01-09 09:52:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092363325] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:52:48,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:52:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 15] total 34 [2025-01-09 09:52:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119452074] [2025-01-09 09:52:48,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:52:48,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 09:52:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:48,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 09:52:48,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 09:52:48,439 INFO L87 Difference]: Start difference. First operand 421 states and 660 transitions. Second operand has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 11 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (73), 10 states have call predecessors, (73), 11 states have call successors, (73) [2025-01-09 09:52:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:49,949 INFO L93 Difference]: Finished difference Result 795 states and 1196 transitions. [2025-01-09 09:52:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 09:52:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 11 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (73), 10 states have call predecessors, (73), 11 states have call successors, (73) Word has length 183 [2025-01-09 09:52:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:49,952 INFO L225 Difference]: With dead ends: 795 [2025-01-09 09:52:49,952 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 09:52:49,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1037, Invalid=2623, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 09:52:49,955 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 793 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:49,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 634 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:52:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 09:52:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2025-01-09 09:52:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 276 states have internal predecessors, (376), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 09:52:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 512 transitions. [2025-01-09 09:52:49,992 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 512 transitions. Word has length 183 [2025-01-09 09:52:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:49,993 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 512 transitions. [2025-01-09 09:52:49,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 11 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (73), 10 states have call predecessors, (73), 11 states have call successors, (73) [2025-01-09 09:52:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 512 transitions. [2025-01-09 09:52:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 09:52:49,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:49,995 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:50,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:52:50,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:50,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1115981963, now seen corresponding path program 1 times [2025-01-09 09:52:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:50,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334015133] [2025-01-09 09:52:50,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:50,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:50,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 09:52:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 09:52:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334015133] [2025-01-09 09:52:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334015133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:52:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275032248] [2025-01-09 09:52:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:50,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:52:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:50,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:52:50,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:52:50,410 INFO L87 Difference]: Start difference. First operand 357 states and 512 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:50,817 INFO L93 Difference]: Finished difference Result 1239 states and 1781 transitions. [2025-01-09 09:52:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:52:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2025-01-09 09:52:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:50,823 INFO L225 Difference]: With dead ends: 1239 [2025-01-09 09:52:50,823 INFO L226 Difference]: Without dead ends: 1061 [2025-01-09 09:52:50,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:52:50,824 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 440 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:50,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 736 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:52:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-01-09 09:52:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1049. [2025-01-09 09:52:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 802 states have (on average 1.374064837905237) internal successors, (1102), 808 states have internal predecessors, (1102), 204 states have call successors, (204), 42 states have call predecessors, (204), 42 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 09:52:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1510 transitions. [2025-01-09 09:52:50,884 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1510 transitions. Word has length 183 [2025-01-09 09:52:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:50,884 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1510 transitions. [2025-01-09 09:52:50,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1510 transitions. [2025-01-09 09:52:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 09:52:50,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:50,886 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:50,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:52:50,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:50,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:50,887 INFO L85 PathProgramCache]: Analyzing trace with hash -363929418, now seen corresponding path program 1 times [2025-01-09 09:52:50,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927666387] [2025-01-09 09:52:50,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 09:52:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 09:52:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927666387] [2025-01-09 09:52:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927666387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:51,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:52:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854039496] [2025-01-09 09:52:51,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:52:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:51,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:52:51,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:52:51,102 INFO L87 Difference]: Start difference. First operand 1049 states and 1510 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:51,579 INFO L93 Difference]: Finished difference Result 2115 states and 3039 transitions. [2025-01-09 09:52:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:52:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2025-01-09 09:52:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:51,585 INFO L225 Difference]: With dead ends: 2115 [2025-01-09 09:52:51,585 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 09:52:51,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:52:51,587 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 441 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:51,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 866 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:52:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 09:52:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1053. [2025-01-09 09:52:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 806 states have (on average 1.369727047146402) internal successors, (1104), 812 states have internal predecessors, (1104), 204 states have call successors, (204), 42 states have call predecessors, (204), 42 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 09:52:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1512 transitions. [2025-01-09 09:52:51,644 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1512 transitions. Word has length 184 [2025-01-09 09:52:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1512 transitions. [2025-01-09 09:52:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:52:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1512 transitions. [2025-01-09 09:52:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 09:52:51,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:51,646 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:51,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:52:51,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:51,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 423745769, now seen corresponding path program 1 times [2025-01-09 09:52:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421818815] [2025-01-09 09:52:51,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:51,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 09:52:51,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 09:52:51,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:51,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:52:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421818815] [2025-01-09 09:52:51,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421818815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:51,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:51,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:52:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187522279] [2025-01-09 09:52:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:51,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:52:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:51,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:52:51,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:52:51,779 INFO L87 Difference]: Start difference. First operand 1053 states and 1512 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:52,032 INFO L93 Difference]: Finished difference Result 2303 states and 3322 transitions. [2025-01-09 09:52:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:52:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2025-01-09 09:52:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:52,039 INFO L225 Difference]: With dead ends: 2303 [2025-01-09 09:52:52,040 INFO L226 Difference]: Without dead ends: 1773 [2025-01-09 09:52:52,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:52:52,041 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 265 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:52,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 602 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:52:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-01-09 09:52:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1637. [2025-01-09 09:52:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1254 states have (on average 1.3748006379585327) internal successors, (1724), 1260 states have internal predecessors, (1724), 316 states have call successors, (316), 66 states have call predecessors, (316), 66 states have return successors, (316), 310 states have call predecessors, (316), 316 states have call successors, (316) [2025-01-09 09:52:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2356 transitions. [2025-01-09 09:52:52,130 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2356 transitions. Word has length 184 [2025-01-09 09:52:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:52,131 INFO L471 AbstractCegarLoop]: Abstraction has 1637 states and 2356 transitions. [2025-01-09 09:52:52,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:52:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2356 transitions. [2025-01-09 09:52:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 09:52:52,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:52,132 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:52,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:52:52,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:52,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2032429112, now seen corresponding path program 1 times [2025-01-09 09:52:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836821106] [2025-01-09 09:52:52,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 09:52:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 09:52:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:52:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322450638] [2025-01-09 09:52:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:52,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:52,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:52,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:52:52,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:52:52,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 09:52:52,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 09:52:52,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:52,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:52:52,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:52:52,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 09:52:52,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 09:52:52,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:52:52,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:52:52,417 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:52:52,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:52:52,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 09:52:52,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:52,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:52:52,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:52:52,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:52:52 BoogieIcfgContainer [2025-01-09 09:52:52,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:52:52,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:52:52,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:52:52,714 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:52:52,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:52:42" (3/4) ... [2025-01-09 09:52:52,716 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:52:52,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:52:52,717 INFO L158 Benchmark]: Toolchain (without parser) took 10997.30ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 106.6MB in the beginning and 144.3MB in the end (delta: -37.7MB). Peak memory consumption was 242.3MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:52:52,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.62ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.20ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:52:52,718 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 80.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,718 INFO L158 Benchmark]: RCFGBuilder took 570.57ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 50.3MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,718 INFO L158 Benchmark]: TraceAbstraction took 10079.82ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 49.5MB in the beginning and 144.5MB in the end (delta: -95.0MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,718 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 419.4MB. Free memory was 144.5MB in the beginning and 144.3MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:52:52,720 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.62ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 90.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.20ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 80.3MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 570.57ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 50.3MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10079.82ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 49.5MB in the beginning and 144.5MB in the end (delta: -95.0MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 419.4MB. Free memory was 144.5MB in the beginning and 144.3MB in the end (delta: 133.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of bitwiseOr at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned short int var_1_25 = 2; [L39] unsigned short int var_1_26 = 1; [L40] unsigned short int var_1_27 = 64; [L41] signed long int var_1_28 = -4; [L42] unsigned long int var_1_29 = 10; [L43] unsigned char var_1_30 = 4; [L44] unsigned char var_1_31 = 16; [L45] signed long int var_1_32 = 8; [L46] float var_1_33 = 24.55; [L47] signed long int var_1_34 = 5; [L48] unsigned short int var_1_35 = 256; [L49] unsigned char var_1_36 = 0; [L50] unsigned long int last_1_var_1_10 = 256; [L51] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L172] isInitial = 1 [L173] FCALL initially() [L175] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L119] var_1_3 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L121] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L121] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L122] var_1_5 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L123] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L124] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L124] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L125] var_1_13 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L126] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L127] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L127] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L128] var_1_14 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L133] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L133] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L134] var_1_16 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L135] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L136] var_1_21 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L137] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L138] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L138] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L139] var_1_22 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L140] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L141] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L141] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L142] var_1_25 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L144] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L144] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L145] var_1_26 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L146] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L147] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L147] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L148] var_1_27 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L149] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L150] CALL assume_abort_if_not(var_1_27 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L150] RET assume_abort_if_not(var_1_27 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L151] var_1_31 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L152] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L153] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L154] var_1_33 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L155] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L156] var_1_34 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L157] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L158] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=42, var_1_6=256] [L159] var_1_36 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=42, var_1_6=256] [L160] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=42, var_1_6=256] [L161] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L161] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L176] RET updateVariables() [L177] CALL step() [L55] COND TRUE var_1_25 >= ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L56] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L58] var_1_28 = var_1_27 [L59] var_1_29 = var_1_26 [L60] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L61] COND FALSE !(((((1.25f) < 0 ) ? -(1.25f) : (1.25f))) != var_1_33) [L68] var_1_32 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L70] COND TRUE \read(var_1_36) [L71] var_1_35 = ((((var_1_30) > (((((128) < 0 ) ? -(128) : (128))))) ? (var_1_30) : (((((128) < 0 ) ? -(128) : (128)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L73] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L78] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-42, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L79] COND TRUE stepLocal_2 > last_1_var_1_10 [L80] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L82] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L87] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=85, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L88] COND FALSE !(stepLocal_1 || var_1_3) [L93] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L95] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L106] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L111] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L111] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L112] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L113] COND TRUE var_1_12 == var_1_12 [L114] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L168-L169] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=85, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=42, var_1_21=127, var_1_22=34, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=42, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2223 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2223 mSDsluCounter, 4064 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2688 mSDsCounter, 872 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1448 IncrementalHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 872 mSolverCounterUnsat, 1376 mSDtfsCounter, 1448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1637occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 270 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2194 NumberOfCodeBlocks, 2194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1996 ConstructedInterpolants, 0 QuantifiedInterpolants, 9075 SizeOfPredicates, 8 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 16098/16632 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-01-09 09:52:52,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:52:54,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:52:54,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:52:54,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:52:54,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:52:54,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:52:54,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:52:54,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:52:54,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:52:54,918 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:52:54,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:52:54,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:52:54,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:52:54,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:52:54,921 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:52:54,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:52:54,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:52:54,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:52:54,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:54,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:54,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:52:54,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:52:54,924 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2025-01-09 09:52:55,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:52:55,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:52:55,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:52:55,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:52:55,193 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:52:55,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:52:56,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/212d40cc0/0be1fbf7db454bae965b50032db25fcc/FLAG6f2cc0799 [2025-01-09 09:52:56,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:52:56,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:52:56,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/212d40cc0/0be1fbf7db454bae965b50032db25fcc/FLAG6f2cc0799 [2025-01-09 09:52:56,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/212d40cc0/0be1fbf7db454bae965b50032db25fcc [2025-01-09 09:52:56,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:52:56,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:52:56,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:56,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:52:56,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:52:56,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58119ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56, skipping insertion in model container [2025-01-09 09:52:56,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:52:56,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-01-09 09:52:56,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:56,883 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:52:56,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2025-01-09 09:52:56,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:56,924 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:52:56,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56 WrapperNode [2025-01-09 09:52:56,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:56,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:56,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:52:56,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:52:56,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,977 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-01-09 09:52:56,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:56,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:52:56,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:52:56,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:52:56,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,994 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-01-09 09:52:56,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:52:57,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:52:57,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:52:57,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:52:57,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:57,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:57,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:57,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:52:57,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:52:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:52:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:52:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:52:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:52:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:52:57,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:52:57,136 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:52:57,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:53:11,118 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:53:11,118 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:53:11,129 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:53:11,129 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:53:11,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:53:11 BoogieIcfgContainer [2025-01-09 09:53:11,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:53:11,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:53:11,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:53:11,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:53:11,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:52:56" (1/3) ... [2025-01-09 09:53:11,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb77d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:53:11, skipping insertion in model container [2025-01-09 09:53:11,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (2/3) ... [2025-01-09 09:53:11,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbb77d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:53:11, skipping insertion in model container [2025-01-09 09:53:11,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:53:11" (3/3) ... [2025-01-09 09:53:11,139 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2025-01-09 09:53:11,149 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:53:11,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:53:11,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:53:11,193 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;@11e6d1b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:53:11,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:53:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:53:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 09:53:11,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:11,204 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:53:11,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:11,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1694743649, now seen corresponding path program 1 times [2025-01-09 09:53:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:53:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484944276] [2025-01-09 09:53:11,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:11,216 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-01-09 09:53:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:53:11,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:53:11,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 09:53:11,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 09:53:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 09:53:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:12,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:53:12,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:53:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-01-09 09:53:12,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:53:12,319 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:53:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484944276] [2025-01-09 09:53:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484944276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:53:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214933414] [2025-01-09 09:53:12,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:12,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:53:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:53:12,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:53:12,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:53:12,347 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:53:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:12,365 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2025-01-09 09:53:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:53:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-01-09 09:53:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:12,370 INFO L225 Difference]: With dead ends: 162 [2025-01-09 09:53:12,370 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 09:53:12,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-01-09 09:53:12,374 INFO L435 NwaCegarLoop]: 126 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, 126 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-01-09 09:53:12,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:53:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 09:53:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 09:53:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 09:53:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2025-01-09 09:53:12,403 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 178 [2025-01-09 09:53:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2025-01-09 09:53:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 09:53:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2025-01-09 09:53:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 09:53:12,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:12,406 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:53:12,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 09:53:12,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:53:12,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash -314664291, now seen corresponding path program 1 times [2025-01-09 09:53:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:53:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263357628] [2025-01-09 09:53:12,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:12,613 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-01-09 09:53:12,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:53:12,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:53:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 09:53:12,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 09:53:13,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 09:53:13,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:13,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:13,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 09:53:13,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:53:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:53:17,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:53:17,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:53:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263357628] [2025-01-09 09:53:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263357628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:53:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602168434] [2025-01-09 09:53:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:53:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:53:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:53:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:53:17,960 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:53:22,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:26,365 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-01-09 09:53:30,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:34,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:38,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:42,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:45,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:47,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:52,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:56,261 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-01-09 09:53:59,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:53:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:59,479 INFO L93 Difference]: Finished difference Result 237 states and 372 transitions. [2025-01-09 09:53:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:53:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-01-09 09:53:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:59,607 INFO L225 Difference]: With dead ends: 237 [2025-01-09 09:53:59,607 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 09:53:59,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:53:59,609 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 35 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:59,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 385 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 41.4s Time] [2025-01-09 09:53:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 09:53:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 09:53:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:53:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2025-01-09 09:53:59,631 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 178 [2025-01-09 09:53:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:59,632 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2025-01-09 09:53:59,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:53:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2025-01-09 09:53:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:53:59,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:59,634 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:53:59,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 09:53:59,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:53:59,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:59,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:59,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1443404801, now seen corresponding path program 1 times [2025-01-09 09:53:59,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:53:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216617749] [2025-01-09 09:53:59,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:59,840 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-01-09 09:53:59,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:53:59,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:53:59,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:53:59,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:54:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:54:00,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:54:00,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:54:00,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:54:00,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:54:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:54:00,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:54:00,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:54:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216617749] [2025-01-09 09:54:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216617749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:54:00,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:54:00,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:54:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905299349] [2025-01-09 09:54:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:54:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:54:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:54:00,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:54:00,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:54:00,945 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:54:05,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:54:09,418 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-01-09 09:54:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:54:09,549 INFO L93 Difference]: Finished difference Result 353 states and 548 transitions. [2025-01-09 09:54:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:54:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-01-09 09:54:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:54:09,554 INFO L225 Difference]: With dead ends: 353 [2025-01-09 09:54:09,554 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 09:54:09,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:54:09,556 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 29 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:54:09,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 242 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 09:54:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 09:54:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2025-01-09 09:54:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 115 states have internal predecessors, (157), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:54:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 269 transitions. [2025-01-09 09:54:09,570 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 269 transitions. Word has length 179 [2025-01-09 09:54:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:54:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 269 transitions. [2025-01-09 09:54:09,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:54:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 269 transitions. [2025-01-09 09:54:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:54:09,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:54:09,572 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:54:09,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 09:54:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:54:09,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:54:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:54:09,773 INFO L85 PathProgramCache]: Analyzing trace with hash -877920908, now seen corresponding path program 1 times [2025-01-09 09:54:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:54:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556925402] [2025-01-09 09:54:09,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:54:09,774 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-01-09 09:54:09,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:54:09,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:54:09,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 09:54:09,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:54:10,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:54:10,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:54:10,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:54:10,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:54:10,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:54:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 09:54:10,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:54:10,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:54:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556925402] [2025-01-09 09:54:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556925402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:54:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:54:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:54:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383183523] [2025-01-09 09:54:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:54:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:54:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:54:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:54:10,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:54:10,883 INFO L87 Difference]: Start difference. First operand 174 states and 269 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:54:15,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 09:54:19,322 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-01-09 09:54:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:54:19,484 INFO L93 Difference]: Finished difference Result 369 states and 566 transitions. [2025-01-09 09:54:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:54:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2025-01-09 09:54:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:54:19,486 INFO L225 Difference]: With dead ends: 369 [2025-01-09 09:54:19,486 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 09:54:19,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:54:19,487 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:54:19,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 245 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 09:54:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 09:54:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2025-01-09 09:54:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 115 states have internal predecessors, (151), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 09:54:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2025-01-09 09:54:19,513 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 180 [2025-01-09 09:54:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:54:19,516 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2025-01-09 09:54:19,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 09:54:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2025-01-09 09:54:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:54:19,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:54:19,517 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:54:19,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 09:54:19,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:54:19,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:54:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:54:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash -321201159, now seen corresponding path program 1 times [2025-01-09 09:54:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:54:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099355908] [2025-01-09 09:54:19,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:54:19,724 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-01-09 09:54:19,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:54:19,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:54:19,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 09:54:19,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:54:20,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:54:20,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:54:20,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:54:20,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:54:20,614 INFO L279 TraceCheckSpWp]: Computing forward predicates...