./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.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_fillercodestructure_filler-ps-cn_file-30.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 f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:51:37,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:51:37,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:51:37,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:51:37,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:51:37,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:51:37,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:51:37,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:51:37,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:51:37,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:51:37,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:51:37,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:51:37,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:51:37,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:51:37,295 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:51:37,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:51:37,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:51:37,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:37,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:37,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:51:37,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:51:37,297 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 -> f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 [2025-01-09 11:51:37,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:51:37,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:51:37,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:51:37,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:51:37,579 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:51:37,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:51:38,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3874e1ad6/9c8db0b203d848a4b0a75f15cf140061/FLAGb09ef5c9d [2025-01-09 11:51:39,052 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:51:39,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:51:39,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3874e1ad6/9c8db0b203d848a4b0a75f15cf140061/FLAGb09ef5c9d [2025-01-09 11:51:39,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3874e1ad6/9c8db0b203d848a4b0a75f15cf140061 [2025-01-09 11:51:39,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:51:39,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:51:39,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:51:39,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:51:39,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:51:39,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39, skipping insertion in model container [2025-01-09 11:51:39,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:51:39,239 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_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2025-01-09 11:51:39,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:51:39,326 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:51:39,339 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_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2025-01-09 11:51:39,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:51:39,402 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:51:39,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39 WrapperNode [2025-01-09 11:51:39,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:51:39,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:51:39,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:51:39,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:51:39,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,459 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2025-01-09 11:51:39,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:51:39,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:51:39,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:51:39,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:51:39,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,493 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 11:51:39,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:51:39,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:51:39,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:51:39,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:51:39,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (1/1) ... [2025-01-09 11:51:39,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:51:39,552 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 11:51:39,556 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 11:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:51:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:51:39,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:51:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:51:39,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:51:39,654 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:51:39,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:51:39,970 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 11:51:39,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:51:39,980 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:51:39,980 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:51:39,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:51:39 BoogieIcfgContainer [2025-01-09 11:51:39,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:51:39,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:51:39,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:51:39,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:51:39,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:51:39" (1/3) ... [2025-01-09 11:51:39,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19de5181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:51:39, skipping insertion in model container [2025-01-09 11:51:39,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:39" (2/3) ... [2025-01-09 11:51:39,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19de5181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:51:39, skipping insertion in model container [2025-01-09 11:51:39,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:51:39" (3/3) ... [2025-01-09 11:51:39,992 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:51:40,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:51:40,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:51:40,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:51:40,074 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;@255a9d6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:51:40,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:51:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:51:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:51:40,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:40,093 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:40,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash -517405116, now seen corresponding path program 1 times [2025-01-09 11:51:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-01-09 11:51:40,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:40,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:51:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:51:40,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:51:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354236282] [2025-01-09 11:51:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354236282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:51:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407292550] [2025-01-09 11:51:40,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:51:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:51:40,454 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 11:51:40,456 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 11:51:40,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:51:40,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:51:40,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:40,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:40,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:51:40,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:51:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 11:51:40,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:51:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407292550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:51:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:51:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69443854] [2025-01-09 11:51:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:40,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:51:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:51:40,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:51:40,752 INFO L87 Difference]: Start difference. First operand has 111 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:51:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:40,790 INFO L93 Difference]: Finished difference Result 216 states and 378 transitions. [2025-01-09 11:51:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:51:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 217 [2025-01-09 11:51:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:40,799 INFO L225 Difference]: With dead ends: 216 [2025-01-09 11:51:40,799 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 11:51:40,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 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 11:51:40,804 INFO L435 NwaCegarLoop]: 170 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, 170 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 11:51:40,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:51:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 11:51:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 11:51:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:51:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2025-01-09 11:51:40,845 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 217 [2025-01-09 11:51:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:40,845 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2025-01-09 11:51:40,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:51:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2025-01-09 11:51:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:51:40,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:40,849 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:40,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 11:51:41,050 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 11:51:41,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1491302606, now seen corresponding path program 1 times [2025-01-09 11:51:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414773904] [2025-01-09 11:51:41,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:41,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:41,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:51:41,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:51:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:51:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:41,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414773904] [2025-01-09 11:51:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414773904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:41,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:51:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:51:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283721167] [2025-01-09 11:51:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:41,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:51:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:51:41,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:51:41,275 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:41,322 INFO L93 Difference]: Finished difference Result 285 states and 449 transitions. [2025-01-09 11:51:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:51:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2025-01-09 11:51:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:41,325 INFO L225 Difference]: With dead ends: 285 [2025-01-09 11:51:41,325 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 11:51:41,326 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 11:51:41,327 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 112 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:41,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 324 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:51:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 11:51:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2025-01-09 11:51:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 125 states have (on average 1.448) internal successors, (181), 126 states have internal predecessors, (181), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 11:51:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 279 transitions. [2025-01-09 11:51:41,345 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 279 transitions. Word has length 217 [2025-01-09 11:51:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:41,346 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 279 transitions. [2025-01-09 11:51:41,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 279 transitions. [2025-01-09 11:51:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:51:41,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:41,350 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:51:41,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1114720948, now seen corresponding path program 1 times [2025-01-09 11:51:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-01-09 11:51:41,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:51:41,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:51:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:51:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-01-09 11:51:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428168890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:41,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:51:41,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:51:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038350817] [2025-01-09 11:51:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:41,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:51:41,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:41,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:51:41,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:51:41,601 INFO L87 Difference]: Start difference. First operand 177 states and 279 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:41,645 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2025-01-09 11:51:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:51:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 217 [2025-01-09 11:51:41,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:41,649 INFO L225 Difference]: With dead ends: 352 [2025-01-09 11:51:41,649 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 11:51:41,654 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 11:51:41,656 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:41,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:51:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 11:51:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2025-01-09 11:51:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 125 states have (on average 1.432) internal successors, (179), 126 states have internal predecessors, (179), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 11:51:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2025-01-09 11:51:41,689 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 217 [2025-01-09 11:51:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:41,690 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2025-01-09 11:51:41,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2025-01-09 11:51:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:51:41,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:41,694 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:41,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:51:41,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:41,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash 678044628, now seen corresponding path program 1 times [2025-01-09 11:51:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243290530] [2025-01-09 11:51:41,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:41,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:51:41,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:51:41,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:41,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:51:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243290530] [2025-01-09 11:51:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243290530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:41,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:51:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:51:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460885770] [2025-01-09 11:51:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:51:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:41,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:51:41,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:51:41,888 INFO L87 Difference]: Start difference. First operand 177 states and 277 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:42,088 INFO L93 Difference]: Finished difference Result 418 states and 650 transitions. [2025-01-09 11:51:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:51:42,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-01-09 11:51:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:42,094 INFO L225 Difference]: With dead ends: 418 [2025-01-09 11:51:42,094 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 11:51:42,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:51:42,097 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 258 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:42,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 357 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:51:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 11:51:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2025-01-09 11:51:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 156 states have internal predecessors, (206), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 11:51:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 370 transitions. [2025-01-09 11:51:42,170 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 370 transitions. Word has length 218 [2025-01-09 11:51:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:42,170 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 370 transitions. [2025-01-09 11:51:42,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 370 transitions. [2025-01-09 11:51:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:51:42,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:42,172 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:42,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:51:42,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:42,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1316100078, now seen corresponding path program 1 times [2025-01-09 11:51:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:42,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-01-09 11:51:42,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:42,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:51:42,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:51:42,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:51:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049756032] [2025-01-09 11:51:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049756032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:51:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:51:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32463899] [2025-01-09 11:51:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:42,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:51:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:51:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:51:42,488 INFO L87 Difference]: Start difference. First operand 241 states and 370 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:42,713 INFO L93 Difference]: Finished difference Result 641 states and 997 transitions. [2025-01-09 11:51:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:51:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 218 [2025-01-09 11:51:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:42,718 INFO L225 Difference]: With dead ends: 641 [2025-01-09 11:51:42,719 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 11:51:42,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:51:42,720 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 161 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:42,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 518 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:51:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 11:51:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 413. [2025-01-09 11:51:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 275 states have (on average 1.3563636363636364) internal successors, (373), 278 states have internal predecessors, (373), 131 states have call successors, (131), 6 states have call predecessors, (131), 6 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 11:51:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 635 transitions. [2025-01-09 11:51:42,772 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 635 transitions. Word has length 218 [2025-01-09 11:51:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 635 transitions. [2025-01-09 11:51:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 635 transitions. [2025-01-09 11:51:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:51:42,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:42,775 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:42,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:51:42,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:42,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 170032782, now seen corresponding path program 1 times [2025-01-09 11:51:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865467876] [2025-01-09 11:51:42,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:42,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:51:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:51:42,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:42,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 11:51:43,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:43,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865467876] [2025-01-09 11:51:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865467876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:51:43,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316311652] [2025-01-09 11:51:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:43,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:51:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:51:43,450 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 11:51:43,452 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 11:51:43,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:51:43,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:51:43,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:43,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:43,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 11:51:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:51:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:51:44,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:51:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 11:51:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316311652] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:51:44,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:51:44,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-01-09 11:51:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492065772] [2025-01-09 11:51:44,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:51:44,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 11:51:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:44,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 11:51:44,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:51:44,468 INFO L87 Difference]: Start difference. First operand 413 states and 635 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2025-01-09 11:51:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:44,867 INFO L93 Difference]: Finished difference Result 633 states and 943 transitions. [2025-01-09 11:51:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:51:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) Word has length 219 [2025-01-09 11:51:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:44,872 INFO L225 Difference]: With dead ends: 633 [2025-01-09 11:51:44,872 INFO L226 Difference]: Without dead ends: 459 [2025-01-09 11:51:44,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 432 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:51:44,874 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 404 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:44,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 410 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:51:44,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-09 11:51:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 453. [2025-01-09 11:51:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 305 states have (on average 1.3081967213114754) internal successors, (399), 308 states have internal predecessors, (399), 131 states have call successors, (131), 16 states have call predecessors, (131), 16 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 11:51:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 661 transitions. [2025-01-09 11:51:44,954 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 661 transitions. Word has length 219 [2025-01-09 11:51:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:44,954 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 661 transitions. [2025-01-09 11:51:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2025-01-09 11:51:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 661 transitions. [2025-01-09 11:51:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:51:44,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:44,957 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:44,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:51:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:51:45,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:45,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1108721320, now seen corresponding path program 1 times [2025-01-09 11:51:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987893877] [2025-01-09 11:51:45,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:45,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:51:45,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:51:45,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:45,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:51:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:51:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:51:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987893877] [2025-01-09 11:51:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987893877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:51:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:51:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:51:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129968247] [2025-01-09 11:51:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:51:45,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:51:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:51:45,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:51:45,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:51:45,257 INFO L87 Difference]: Start difference. First operand 453 states and 661 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:51:45,320 INFO L93 Difference]: Finished difference Result 831 states and 1218 transitions. [2025-01-09 11:51:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:51:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 220 [2025-01-09 11:51:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:51:45,326 INFO L225 Difference]: With dead ends: 831 [2025-01-09 11:51:45,326 INFO L226 Difference]: Without dead ends: 453 [2025-01-09 11:51:45,328 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 11:51:45,329 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:51:45,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:51:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-09 11:51:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-01-09 11:51:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 305 states have (on average 1.2950819672131149) internal successors, (395), 308 states have internal predecessors, (395), 131 states have call successors, (131), 16 states have call predecessors, (131), 16 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 11:51:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 657 transitions. [2025-01-09 11:51:45,401 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 657 transitions. Word has length 220 [2025-01-09 11:51:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:51:45,402 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 657 transitions. [2025-01-09 11:51:45,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:51:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 657 transitions. [2025-01-09 11:51:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 11:51:45,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:51:45,404 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:45,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:51:45,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:51:45,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:51:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -206257159, now seen corresponding path program 1 times [2025-01-09 11:51:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:51:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880609201] [2025-01-09 11:51:45,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:51:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:51:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 11:51:45,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 11:51:45,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:45,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:51:45,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:51:45,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 11:51:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 11:51:45,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:51:45,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:51:45,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:51:45,616 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:51:45,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:51:45,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:51:45,619 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:51:45,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:51:45,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:51:45 BoogieIcfgContainer [2025-01-09 11:51:45,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:51:45,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:51:45,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:51:45,747 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:51:45,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:51:39" (3/4) ... [2025-01-09 11:51:45,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:51:45,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:51:45,752 INFO L158 Benchmark]: Toolchain (without parser) took 6661.03ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.6MB in the beginning and 92.6MB in the end (delta: 37.1MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2025-01-09 11:51:45,753 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:51:45,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.31ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 114.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:51:45,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:51:45,753 INFO L158 Benchmark]: Boogie Preprocessor took 54.91ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:51:45,754 INFO L158 Benchmark]: RCFGBuilder took 462.14ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 85.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:51:45,754 INFO L158 Benchmark]: TraceAbstraction took 5763.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 84.8MB in the beginning and 92.6MB in the end (delta: -7.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-01-09 11:51:45,754 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 201.3MB. Free memory was 92.6MB in the beginning and 92.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:51:45,756 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.37ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.31ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 114.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 111.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.91ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 108.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 462.14ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 85.2MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5763.16ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 84.8MB in the beginning and 92.6MB in the end (delta: -7.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 201.3MB. Free memory was 92.6MB in the beginning and 92.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryDOUBLEComparisonOperation at line 221, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 221, overapproximation of someBinaryDOUBLEComparisonOperation at line 184, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] double var_1_26 = 9.75; [L43] unsigned char var_1_27 = 1; [L44] signed char var_1_28 = 8; [L45] unsigned long int var_1_29 = 16; [L46] unsigned long int var_1_30 = 1; [L47] float var_1_31 = 16.6; [L48] unsigned char var_1_32 = 0; [L49] float var_1_33 = 0.25; [L50] float var_1_34 = 99.8; [L51] signed short int var_1_35 = 256; [L52] unsigned long int var_1_36 = 16; [L53] double var_1_37 = 8.5; [L54] unsigned long int var_1_38 = 3569725445; [L55] unsigned long int var_1_39 = 3551809449; [L56] unsigned long int var_1_40 = 10000000; [L57] unsigned char last_1_var_1_1 = 1; [L58] signed long int last_1_var_1_11 = -2; [L59] signed long int last_1_var_1_15 = 1000; [L60] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L225] isInitial = 1 [L226] FCALL initially() [L228] CALL updateLastVariables() [L215] last_1_var_1_1 = var_1_1 [L216] last_1_var_1_11 = var_1_11 [L217] last_1_var_1_15 = var_1_15 [L218] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L228] RET updateLastVariables() [L229] CALL updateVariables() [L158] var_1_4 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L161] var_1_7 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_10 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] var_1_13 = __VERIFIER_nondet_long() [L166] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_14 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] var_1_17 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_18 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_20 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_23 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_26 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] var_1_27 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] var_1_28 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] var_1_30 = __VERIFIER_nondet_ulong() [L193] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] var_1_32 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L196] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L198] var_1_33 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L199] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L200] var_1_34 = __VERIFIER_nondet_float() [L201] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L201] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L202] var_1_37 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L203] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L204] var_1_38 = __VERIFIER_nondet_ulong() [L205] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L205] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L206] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L207] var_1_39 = __VERIFIER_nondet_ulong() [L208] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L208] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L209] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L210] var_1_40 = __VERIFIER_nondet_ulong() [L211] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L211] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L229] RET updateVariables() [L230] CALL step() [L64] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L65] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L67] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND FALSE !(var_1_21 != var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L75] COND TRUE \read(var_1_27) [L76] var_1_25 = var_1_28 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L81] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L82] COND FALSE !(var_1_22 > var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L89] COND TRUE \read(var_1_27) [L90] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L93] COND TRUE ! ((1 + var_1_24) <= var_1_19) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L94] COND FALSE !(var_1_24 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L98] COND FALSE !(var_1_21 < var_1_23) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L105] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L107] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L112] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L114] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L116] signed long int stepLocal_2 = var_1_11; [L117] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L118] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L119] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L120] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L121] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L127] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L138] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L140] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L141] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L145] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L146] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L147] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L230] RET step() [L231] CALL, EXPR property() [L221] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L221-L222] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L231] RET, EXPR property() [L231] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1001, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-127, var_1_27=1, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_32=0, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=2147483647, var_1_40=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1097 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1096 mSDsluCounter, 2250 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 992 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 1258 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 663 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2183 NumberOfCodeBlocks, 2183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2171 ConstructedInterpolants, 0 QuantifiedInterpolants, 3858 SizeOfPredicates, 1 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 20678/21120 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 11:51:45,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.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 f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:51:47,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:51:47,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 11:51:47,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:51:47,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:51:47,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:51:47,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:51:47,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:51:47,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:51:47,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:51:47,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:51:47,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:51:47,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:51:47,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:51:47,926 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:51:47,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:51:47,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:51:47,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:51:47,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:51:47,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:51:47,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:51:47,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:51:47,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:51:47,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:51:47,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:51:47,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:47,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:47,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:51:47,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:51:47,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:51:47,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:51:47,930 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 -> f2cbb62030ab23e4520c519e21c33cbadba0c771a34e0ede2d3d80a8d3569561 [2025-01-09 11:51:48,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:51:48,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:51:48,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:51:48,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:51:48,193 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:51:48,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:51:49,348 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d9a312c/43b87dd1096f4a699f900a7b97456b28/FLAGf47e09495 [2025-01-09 11:51:49,575 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:51:49,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:51:49,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d9a312c/43b87dd1096f4a699f900a7b97456b28/FLAGf47e09495 [2025-01-09 11:51:49,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30d9a312c/43b87dd1096f4a699f900a7b97456b28 [2025-01-09 11:51:49,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:51:49,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:51:49,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:51:49,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:51:49,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:51:49,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:51:49" (1/1) ... [2025-01-09 11:51:49,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774fac32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:49, skipping insertion in model container [2025-01-09 11:51:49,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:51:49" (1/1) ... [2025-01-09 11:51:49,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:51:50,101 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_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2025-01-09 11:51:50,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:51:50,188 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:51:50,196 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_fillercodestructure_filler-ps-cn_file-30.i[919,932] [2025-01-09 11:51:50,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:51:50,240 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:51:50,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50 WrapperNode [2025-01-09 11:51:50,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:51:50,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:51:50,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:51:50,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:51:50,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,290 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-01-09 11:51:50,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:51:50,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:51:50,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:51:50,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:51:50,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,331 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 11:51:50,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:51:50,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:51:50,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:51:50,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:51:50,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (1/1) ... [2025-01-09 11:51:50,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:51:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:51:50,394 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 11:51:50,400 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 11:51:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:51:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:51:50,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:51:50,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:51:50,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:51:50,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:51:50,503 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:51:50,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:52:17,270 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:52:17,270 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:52:17,281 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:52:17,283 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:52:17,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:52:17 BoogieIcfgContainer [2025-01-09 11:52:17,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:52:17,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:52:17,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:52:17,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:52:17,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:51:49" (1/3) ... [2025-01-09 11:52:17,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f82384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:52:17, skipping insertion in model container [2025-01-09 11:52:17,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:51:50" (2/3) ... [2025-01-09 11:52:17,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f82384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:52:17, skipping insertion in model container [2025-01-09 11:52:17,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:52:17" (3/3) ... [2025-01-09 11:52:17,293 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i [2025-01-09 11:52:17,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:52:17,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-30.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:52:17,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:52:17,356 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;@35a440ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:52:17,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:52:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:52:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:17,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:17,371 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:17,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1010399945, now seen corresponding path program 1 times [2025-01-09 11:52:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:52:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516198979] [2025-01-09 11:52:17,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:17,387 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 11:52:17,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:52:17,389 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 11:52:17,402 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 11:52:17,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:18,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:18,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:18,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:18,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:52:18,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-01-09 11:52:18,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:18,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:52:18,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516198979] [2025-01-09 11:52:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516198979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:18,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:52:18,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62512755] [2025-01-09 11:52:18,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:52:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:52:18,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:52:18,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:52:18,306 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:52:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:18,336 INFO L93 Difference]: Finished difference Result 198 states and 350 transitions. [2025-01-09 11:52:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:52:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 214 [2025-01-09 11:52:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:18,345 INFO L225 Difference]: With dead ends: 198 [2025-01-09 11:52:18,345 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 11:52:18,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 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 11:52:18,350 INFO L435 NwaCegarLoop]: 156 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, 156 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 11:52:18,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:52:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 11:52:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 11:52:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:52:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-01-09 11:52:18,384 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 214 [2025-01-09 11:52:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:18,385 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-01-09 11:52:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:52:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-01-09 11:52:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:18,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:18,388 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:18,412 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 11:52:18,589 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 11:52:18,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:18,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1454231827, now seen corresponding path program 1 times [2025-01-09 11:52:18,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:52:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35672710] [2025-01-09 11:52:18,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:18,591 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 11:52:18,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:52:18,594 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 11:52:18,595 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 11:52:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:19,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:52:19,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:19,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:19,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:52:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35672710] [2025-01-09 11:52:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35672710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:52:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159275815] [2025-01-09 11:52:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:52:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:52:19,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:52:19,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:52:19,531 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:19,765 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2025-01-09 11:52:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:52:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:19,768 INFO L225 Difference]: With dead ends: 258 [2025-01-09 11:52:19,768 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 11:52:19,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 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 11:52:19,769 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 98 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:19,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 295 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:52:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 11:52:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2025-01-09 11:52:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 108 states have internal predecessors, (153), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 11:52:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 251 transitions. [2025-01-09 11:52:19,788 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 251 transitions. Word has length 214 [2025-01-09 11:52:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:19,788 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 251 transitions. [2025-01-09 11:52:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 251 transitions. [2025-01-09 11:52:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:19,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:19,792 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:19,815 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 11:52:19,992 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 11:52:19,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:19,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -433163473, now seen corresponding path program 1 times [2025-01-09 11:52:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:52:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719154188] [2025-01-09 11:52:19,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:19,994 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 11:52:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:52:19,996 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 11:52:19,998 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 11:52:20,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:20,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:20,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:20,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:20,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:52:20,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:21,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:21,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:52:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719154188] [2025-01-09 11:52:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719154188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:52:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324093902] [2025-01-09 11:52:21,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:21,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:52:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:52:21,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:52:21,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:21,131 INFO L87 Difference]: Start difference. First operand 159 states and 251 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:25,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:52:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:25,793 INFO L93 Difference]: Finished difference Result 472 states and 748 transitions. [2025-01-09 11:52:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:52:25,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:25,797 INFO L225 Difference]: With dead ends: 472 [2025-01-09 11:52:25,798 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 11:52:25,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:25,801 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 222 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:25,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 437 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 11:52:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 11:52:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2025-01-09 11:52:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 210 states have (on average 1.4190476190476191) internal successors, (298), 212 states have internal predecessors, (298), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-01-09 11:52:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 494 transitions. [2025-01-09 11:52:25,851 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 494 transitions. Word has length 214 [2025-01-09 11:52:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 494 transitions. [2025-01-09 11:52:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 494 transitions. [2025-01-09 11:52:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 11:52:25,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:25,855 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:25,881 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 11:52:26,055 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 11:52:26,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:26,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash -214308755, now seen corresponding path program 1 times [2025-01-09 11:52:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:52:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804830976] [2025-01-09 11:52:26,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:26,057 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 11:52:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:52:26,059 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 11:52:26,061 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 11:52:26,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 11:52:26,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 11:52:26,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:26,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:26,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:52:26,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:30,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:30,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:52:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804830976] [2025-01-09 11:52:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804830976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:30,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:30,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:52:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617705921] [2025-01-09 11:52:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:30,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:52:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:52:30,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:52:30,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:30,891 INFO L87 Difference]: Start difference. First operand 313 states and 494 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:35,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:52:40,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:52:44,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:52:48,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:52:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:52:49,023 INFO L93 Difference]: Finished difference Result 692 states and 1085 transitions. [2025-01-09 11:52:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:52:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2025-01-09 11:52:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:52:49,027 INFO L225 Difference]: With dead ends: 692 [2025-01-09 11:52:49,027 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 11:52:49,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:49,028 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 194 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:52:49,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 480 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 4 Unknown, 0 Unchecked, 18.1s Time] [2025-01-09 11:52:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 11:52:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 223. [2025-01-09 11:52:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 138 states have internal predecessors, (178), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 11:52:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 342 transitions. [2025-01-09 11:52:49,065 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 342 transitions. Word has length 214 [2025-01-09 11:52:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:52:49,065 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 342 transitions. [2025-01-09 11:52:49,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 342 transitions. [2025-01-09 11:52:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:52:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:52:49,067 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:49,092 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 11:52:49,268 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 11:52:49,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:52:49,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:52:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2114031383, now seen corresponding path program 1 times [2025-01-09 11:52:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:52:49,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868867400] [2025-01-09 11:52:49,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:52:49,269 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 11:52:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:52:49,271 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 11:52:49,272 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 11:52:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:52:49,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:52:49,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:52:49,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:52:49,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 11:52:49,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:52:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:52:53,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:52:53,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:52:53,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868867400] [2025-01-09 11:52:53,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868867400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:52:53,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:52:53,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:52:53,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822768346] [2025-01-09 11:52:53,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:52:53,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:52:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:52:53,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:52:53,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:52:53,785 INFO L87 Difference]: Start difference. First operand 223 states and 342 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:52:58,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:53:00,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:53:05,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:53:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:53:05,180 INFO L93 Difference]: Finished difference Result 569 states and 885 transitions. [2025-01-09 11:53:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:53:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215 [2025-01-09 11:53:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:53:05,222 INFO L225 Difference]: With dead ends: 569 [2025-01-09 11:53:05,222 INFO L226 Difference]: Without dead ends: 413 [2025-01-09 11:53:05,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:53:05,223 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 130 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:53:05,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 462 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2025-01-09 11:53:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-09 11:53:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 377. [2025-01-09 11:53:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 239 states have (on average 1.3263598326359833) internal successors, (317), 242 states have internal predecessors, (317), 131 states have call successors, (131), 6 states have call predecessors, (131), 6 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2025-01-09 11:53:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 579 transitions. [2025-01-09 11:53:05,264 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 579 transitions. Word has length 215 [2025-01-09 11:53:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:53:05,264 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 579 transitions. [2025-01-09 11:53:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:53:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 579 transitions. [2025-01-09 11:53:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:53:05,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:53:05,267 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:05,294 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 (6)] Ended with exit code 0 [2025-01-09 11:53:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 11:53:05,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:53:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:53:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1887413971, now seen corresponding path program 1 times [2025-01-09 11:53:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:53:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384709382] [2025-01-09 11:53:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:53:05,469 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 11:53:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:53:05,470 INFO L229 MonitoredProcess]: Starting monitored process 7 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 11:53:05,471 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 (7)] Waiting until timeout for monitored process [2025-01-09 11:53:05,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:53:06,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:53:06,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:53:06,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:53:06,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 11:53:06,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:53:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 11:53:14,071 INFO L312 TraceCheckSpWp]: Computing backward predicates...