./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:55:15,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:55:15,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:55:15,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:55:15,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:55:15,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:55:15,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:55:15,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:55:15,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:55:15,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:55:15,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:55:15,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:55:15,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:55:15,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:55:15,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:55:15,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:55:15,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:55:15,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:55:15,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:55:15,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:55:15,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:55:15,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:15,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:55:15,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2025-03-16 23:55:15,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:55:15,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:55:15,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:55:15,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:55:15,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:55:15,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:16,697 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303ae9736/ad24a6a299144f6db02e76d6ab872cd3/FLAG41ebd630e [2025-03-16 23:55:16,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:55:16,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:16,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303ae9736/ad24a6a299144f6db02e76d6ab872cd3/FLAG41ebd630e [2025-03-16 23:55:17,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303ae9736/ad24a6a299144f6db02e76d6ab872cd3 [2025-03-16 23:55:17,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:55:17,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:55:17,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:17,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:55:17,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:55:17,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1cd8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17, skipping insertion in model container [2025-03-16 23:55:17,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:55:17,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i[915,928] [2025-03-16 23:55:17,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:17,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:55:17,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i[915,928] [2025-03-16 23:55:17,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:17,522 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:55:17,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17 WrapperNode [2025-03-16 23:55:17,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:17,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:17,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:55:17,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:55:17,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,565 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2025-03-16 23:55:17,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:17,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:55:17,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:55:17,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:55:17,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,602 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:55:17,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:55:17,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:55:17,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:55:17,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:55:17,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (1/1) ... [2025-03-16 23:55:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:17,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:55:17,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:55:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:55:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:55:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:55:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:55:17,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:55:17,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:55:17,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:55:17,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:55:18,055 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-03-16 23:55:18,079 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-16 23:55:18,079 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:55:18,096 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:55:18,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:55:18,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:18 BoogieIcfgContainer [2025-03-16 23:55:18,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:55:18,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:55:18,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:55:18,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:55:18,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:55:17" (1/3) ... [2025-03-16 23:55:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d1b50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:18, skipping insertion in model container [2025-03-16 23:55:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:17" (2/3) ... [2025-03-16 23:55:18,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d1b50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:18, skipping insertion in model container [2025-03-16 23:55:18,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:18" (3/3) ... [2025-03-16 23:55:18,104 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:18,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:55:18,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:55:18,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:55:18,173 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;@6734b542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:55:18,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:55:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:55:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:55:18,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:18,191 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:18,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 485402005, now seen corresponding path program 1 times [2025-03-16 23:55:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998296439] [2025-03-16 23:55:18,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:18,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:55:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:55:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:55:18,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998296439] [2025-03-16 23:55:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998296439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807354280] [2025-03-16 23:55:18,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:18,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:18,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:55:18,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:55:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:55:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:18,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:55:18,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-16 23:55:18,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:55:18,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807354280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:18,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:55:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:55:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647475044] [2025-03-16 23:55:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:18,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:55:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:18,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:55:18,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:55:18,693 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:55:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:18,732 INFO L93 Difference]: Finished difference Result 195 states and 339 transitions. [2025-03-16 23:55:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:55:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2025-03-16 23:55:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:18,739 INFO L225 Difference]: With dead ends: 195 [2025-03-16 23:55:18,740 INFO L226 Difference]: Without dead ends: 97 [2025-03-16 23:55:18,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:55:18,746 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:18,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:55:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-16 23:55:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-16 23:55:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:55:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2025-03-16 23:55:18,783 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 184 [2025-03-16 23:55:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:18,785 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2025-03-16 23:55:18,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:55:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2025-03-16 23:55:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:55:18,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:18,791 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:18,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:55:18,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:55:18,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -551100216, now seen corresponding path program 1 times [2025-03-16 23:55:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205310867] [2025-03-16 23:55:18,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:19,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:55:19,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:55:19,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:19,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:55:19,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:19,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205310867] [2025-03-16 23:55:19,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205310867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:19,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:19,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:55:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858442521] [2025-03-16 23:55:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:19,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:55:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:19,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:55:19,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:55:19,669 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:20,057 INFO L93 Difference]: Finished difference Result 417 states and 633 transitions. [2025-03-16 23:55:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 23:55:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2025-03-16 23:55:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:20,061 INFO L225 Difference]: With dead ends: 417 [2025-03-16 23:55:20,061 INFO L226 Difference]: Without dead ends: 321 [2025-03-16 23:55:20,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:55:20,062 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 311 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:20,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 564 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:55:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-16 23:55:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 203. [2025-03-16 23:55:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 142 states have internal predecessors, (193), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:55:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 309 transitions. [2025-03-16 23:55:20,100 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 309 transitions. Word has length 185 [2025-03-16 23:55:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:20,104 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 309 transitions. [2025-03-16 23:55:20,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 309 transitions. [2025-03-16 23:55:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:55:20,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:20,106 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:20,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:55:20,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:20,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1395572087, now seen corresponding path program 1 times [2025-03-16 23:55:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686049295] [2025-03-16 23:55:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:55:20,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:55:20,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:20,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:55:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686049295] [2025-03-16 23:55:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686049295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:20,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:20,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503579318] [2025-03-16 23:55:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:20,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:20,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:20,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:20,560 INFO L87 Difference]: Start difference. First operand 203 states and 309 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:20,785 INFO L93 Difference]: Finished difference Result 396 states and 599 transitions. [2025-03-16 23:55:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2025-03-16 23:55:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:20,788 INFO L225 Difference]: With dead ends: 396 [2025-03-16 23:55:20,788 INFO L226 Difference]: Without dead ends: 194 [2025-03-16 23:55:20,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:55:20,789 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 94 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:20,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 400 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:55:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-16 23:55:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 163. [2025-03-16 23:55:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:55:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2025-03-16 23:55:20,819 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 185 [2025-03-16 23:55:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:20,822 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2025-03-16 23:55:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2025-03-16 23:55:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 23:55:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:20,824 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:20,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:55:20,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1391147911, now seen corresponding path program 1 times [2025-03-16 23:55:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682346351] [2025-03-16 23:55:20,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:20,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 23:55:20,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 23:55:20,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:20,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:55:21,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:21,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682346351] [2025-03-16 23:55:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682346351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287835669] [2025-03-16 23:55:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:21,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:21,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:21,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:21,164 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:21,301 INFO L93 Difference]: Finished difference Result 309 states and 464 transitions. [2025-03-16 23:55:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-03-16 23:55:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:21,304 INFO L225 Difference]: With dead ends: 309 [2025-03-16 23:55:21,304 INFO L226 Difference]: Without dead ends: 213 [2025-03-16 23:55:21,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:21,305 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 46 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:21,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 409 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:55:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-16 23:55:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-03-16 23:55:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 147 states have internal predecessors, (187), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:55:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2025-03-16 23:55:21,344 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 187 [2025-03-16 23:55:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:21,344 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2025-03-16 23:55:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:55:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2025-03-16 23:55:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 23:55:21,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:21,346 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:55:21,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1882002957, now seen corresponding path program 1 times [2025-03-16 23:55:21,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730180291] [2025-03-16 23:55:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 23:55:21,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 23:55:21,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:21,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 120 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-03-16 23:55:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730180291] [2025-03-16 23:55:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730180291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233726568] [2025-03-16 23:55:22,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:22,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:22,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:22,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:22,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:55:22,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 23:55:22,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 23:55:22,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:22,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:22,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-16 23:55:22,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 890 proven. 120 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2025-03-16 23:55:23,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:55:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 129 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-03-16 23:55:24,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233726568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:55:24,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:55:24,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2025-03-16 23:55:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448953375] [2025-03-16 23:55:24,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:55:24,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 23:55:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:24,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 23:55:24,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2025-03-16 23:55:24,621 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand has 31 states, 29 states have (on average 5.0344827586206895) internal successors, (146), 28 states have internal predecessors, (146), 12 states have call successors, (87), 5 states have call predecessors, (87), 11 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2025-03-16 23:55:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:28,641 INFO L93 Difference]: Finished difference Result 944 states and 1319 transitions. [2025-03-16 23:55:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-16 23:55:28,641 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 5.0344827586206895) internal successors, (146), 28 states have internal predecessors, (146), 12 states have call successors, (87), 5 states have call predecessors, (87), 11 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) Word has length 188 [2025-03-16 23:55:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:28,648 INFO L225 Difference]: With dead ends: 944 [2025-03-16 23:55:28,649 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 23:55:28,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3836 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2555, Invalid=9001, Unknown=0, NotChecked=0, Total=11556 [2025-03-16 23:55:28,653 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 940 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:28,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1699 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 23:55:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 23:55:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 610. [2025-03-16 23:55:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 438 states have (on average 1.2420091324200913) internal successors, (544), 442 states have internal predecessors, (544), 149 states have call successors, (149), 22 states have call predecessors, (149), 22 states have return successors, (149), 145 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-16 23:55:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 842 transitions. [2025-03-16 23:55:28,716 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 842 transitions. Word has length 188 [2025-03-16 23:55:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:28,717 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 842 transitions. [2025-03-16 23:55:28,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 5.0344827586206895) internal successors, (146), 28 states have internal predecessors, (146), 12 states have call successors, (87), 5 states have call predecessors, (87), 11 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2025-03-16 23:55:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 842 transitions. [2025-03-16 23:55:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 23:55:28,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:28,720 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:28,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:55:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:28,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1554651718, now seen corresponding path program 1 times [2025-03-16 23:55:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481042194] [2025-03-16 23:55:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 23:55:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 23:55:28,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-16 23:55:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481042194] [2025-03-16 23:55:29,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481042194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284731044] [2025-03-16 23:55:29,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:29,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:29,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:29,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:55:29,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 23:55:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 23:55:29,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:29,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:29,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 23:55:29,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 274 proven. 216 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2025-03-16 23:55:30,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:55:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-16 23:55:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284731044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:55:30,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:55:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 6] total 21 [2025-03-16 23:55:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170895494] [2025-03-16 23:55:30,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:55:30,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 23:55:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:30,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 23:55:30,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-16 23:55:30,354 INFO L87 Difference]: Start difference. First operand 610 states and 842 transitions. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 7 states have call successors, (87), 4 states have call predecessors, (87), 8 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-03-16 23:55:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:31,077 INFO L93 Difference]: Finished difference Result 1049 states and 1441 transitions. [2025-03-16 23:55:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 23:55:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 7 states have call successors, (87), 4 states have call predecessors, (87), 8 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) Word has length 189 [2025-03-16 23:55:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:31,081 INFO L225 Difference]: With dead ends: 1049 [2025-03-16 23:55:31,081 INFO L226 Difference]: Without dead ends: 527 [2025-03-16 23:55:31,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:55:31,083 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 152 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:31,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1232 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:55:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-16 23:55:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 506. [2025-03-16 23:55:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 366 states have (on average 1.2459016393442623) internal successors, (456), 369 states have internal predecessors, (456), 120 states have call successors, (120), 19 states have call predecessors, (120), 19 states have return successors, (120), 117 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-16 23:55:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 696 transitions. [2025-03-16 23:55:31,142 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 696 transitions. Word has length 189 [2025-03-16 23:55:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 696 transitions. [2025-03-16 23:55:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 7 states have call successors, (87), 4 states have call predecessors, (87), 8 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-03-16 23:55:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 696 transitions. [2025-03-16 23:55:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 23:55:31,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:31,143 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:31,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:55:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:31,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1774689465, now seen corresponding path program 1 times [2025-03-16 23:55:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090392834] [2025-03-16 23:55:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:31,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:31,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:31,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 120 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-03-16 23:55:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090392834] [2025-03-16 23:55:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090392834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887339754] [2025-03-16 23:55:32,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:32,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:32,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 23:55:32,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:32,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:32,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:32,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:32,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 23:55:32,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 885 proven. 186 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 23:55:33,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:55:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887339754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:33,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:55:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 21 [2025-03-16 23:55:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462421668] [2025-03-16 23:55:33,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:55:33,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 23:55:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:33,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 23:55:33,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-03-16 23:55:33,499 INFO L87 Difference]: Start difference. First operand 506 states and 696 transitions. Second operand has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 7 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 7 states have call predecessors, (55), 7 states have call successors, (55) [2025-03-16 23:55:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:35,587 INFO L93 Difference]: Finished difference Result 1207 states and 1635 transitions. [2025-03-16 23:55:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 23:55:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 7 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 7 states have call predecessors, (55), 7 states have call successors, (55) Word has length 190 [2025-03-16 23:55:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:35,592 INFO L225 Difference]: With dead ends: 1207 [2025-03-16 23:55:35,592 INFO L226 Difference]: Without dead ends: 926 [2025-03-16 23:55:35,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1256, Invalid=4444, Unknown=0, NotChecked=0, Total=5700 [2025-03-16 23:55:35,595 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1040 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:35,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1238 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:55:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-16 23:55:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 680. [2025-03-16 23:55:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 499 states have (on average 1.2104208416833668) internal successors, (604), 502 states have internal predecessors, (604), 149 states have call successors, (149), 31 states have call predecessors, (149), 31 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-16 23:55:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 902 transitions. [2025-03-16 23:55:35,666 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 902 transitions. Word has length 190 [2025-03-16 23:55:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:35,666 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 902 transitions. [2025-03-16 23:55:35,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 7 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 7 states have call predecessors, (55), 7 states have call successors, (55) [2025-03-16 23:55:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 902 transitions. [2025-03-16 23:55:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 23:55:35,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:35,667 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:35,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 23:55:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:35,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1158392102, now seen corresponding path program 1 times [2025-03-16 23:55:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103686830] [2025-03-16 23:55:35,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:35,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:35,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:35,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:35,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:55:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254098951] [2025-03-16 23:55:35,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:35,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:35,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:35,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 23:55:35,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:36,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:36,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:36,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 23:55:36,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 890 proven. 120 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2025-03-16 23:55:36,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:55:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103686830] [2025-03-16 23:55:40,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 23:55:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254098951] [2025-03-16 23:55:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254098951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:40,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:55:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-16 23:55:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105651582] [2025-03-16 23:55:40,116 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 23:55:40,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 23:55:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 23:55:40,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:55:40,117 INFO L87 Difference]: Start difference. First operand 680 states and 902 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-16 23:55:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:40,837 INFO L93 Difference]: Finished difference Result 1382 states and 1818 transitions. [2025-03-16 23:55:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 23:55:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 190 [2025-03-16 23:55:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:40,841 INFO L225 Difference]: With dead ends: 1382 [2025-03-16 23:55:40,842 INFO L226 Difference]: Without dead ends: 794 [2025-03-16 23:55:40,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=1143, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 23:55:40,845 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 531 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:40,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 787 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:55:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-16 23:55:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 731. [2025-03-16 23:55:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 547 states have (on average 1.2175502742230346) internal successors, (666), 551 states have internal predecessors, (666), 151 states have call successors, (151), 32 states have call predecessors, (151), 32 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2025-03-16 23:55:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 968 transitions. [2025-03-16 23:55:40,918 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 968 transitions. Word has length 190 [2025-03-16 23:55:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:40,919 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 968 transitions. [2025-03-16 23:55:40,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (29), 4 states have call predecessors, (29), 6 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-16 23:55:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 968 transitions. [2025-03-16 23:55:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 23:55:40,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:40,921 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:40,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 23:55:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:41,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2045895783, now seen corresponding path program 1 times [2025-03-16 23:55:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814380559] [2025-03-16 23:55:41,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:41,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:41,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:41,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:41,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:55:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517294251] [2025-03-16 23:55:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:41,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:41,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:41,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:41,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 23:55:41,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:41,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:55:41,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:55:41,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 23:55:41,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 23:55:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:55:41,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:55:41,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:55:41,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:55:41,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 23:55:41,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:41,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:41,747 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:55:41,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:55:41 BoogieIcfgContainer [2025-03-16 23:55:41,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:55:41,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:55:41,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:55:41,754 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:55:41,754 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:18" (3/4) ... [2025-03-16 23:55:41,755 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:55:41,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:55:41,756 INFO L158 Benchmark]: Toolchain (without parser) took 24489.94ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.2MB in the beginning and 273.0MB in the end (delta: -160.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-16 23:55:41,756 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:41,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.08ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:55:41,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:41,757 INFO L158 Benchmark]: Boogie Preprocessor took 52.92ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 86.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:55:41,757 INFO L158 Benchmark]: IcfgBuilder took 476.30ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 55.5MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:55:41,757 INFO L158 Benchmark]: TraceAbstraction took 23654.60ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 55.0MB in the beginning and 273.0MB in the end (delta: -218.0MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-03-16 23:55:41,757 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 327.2MB. Free memory was 273.0MB in the beginning and 273.0MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:41,758 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.21ms. Allocated memory is still 226.5MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.08ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.92ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 86.0MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 476.30ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 55.5MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23654.60ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 55.0MB in the beginning and 273.0MB in the end (delta: -218.0MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 327.2MB. Free memory was 273.0MB in the beginning and 273.0MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of bitwiseOr at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_24 = 128.8; [L43] signed short int var_1_25 = -4; [L44] signed short int var_1_26 = 256; [L45] unsigned long int var_1_27 = 100000000; [L46] unsigned long int var_1_28 = 5; [L47] unsigned char var_1_29 = 8; [L48] unsigned char var_1_30 = 8; [L49] signed long int var_1_31 = 200; [L50] double var_1_32 = 8.25; [L51] double var_1_33 = 15.5; [L52] unsigned char last_1_var_1_8 = 64; [L53] unsigned char last_1_var_1_19 = 1; [L54] unsigned short int last_1_var_1_20 = 256; [L55] unsigned long int last_1_var_1_22 = 64; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L159] last_1_var_1_8 = var_1_8 [L160] last_1_var_1_19 = var_1_19 [L161] last_1_var_1_20 = var_1_20 [L162] last_1_var_1_22 = var_1_22 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L112] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L114] var_1_4 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L115] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L117] var_1_5 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L118] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_6=10, var_1_8=64, var_1_9=5] [L119] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L119] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L120] var_1_6 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_8=64, var_1_9=5] [L121] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_8=64, var_1_9=5] [L122] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L122] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L123] var_1_9 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64] [L124] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L125] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L128] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L128] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L131] var_1_14 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L132] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L133] var_1_15 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L134] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L136] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L137] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L137] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L138] var_1_18 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L140] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L140] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L141] var_1_21 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L142] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L143] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L143] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L144] var_1_24 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L145] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L146] var_1_26 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_26 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L147] RET assume_abort_if_not(var_1_26 >= -32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L148] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L148] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L149] var_1_28 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L150] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L151] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L151] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L152] var_1_30 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L153] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L154] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L154] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L155] var_1_32 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L156] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L173] RET updateVariables() [L174] CALL step() [L59] var_1_23 = var_1_24 [L60] var_1_25 = var_1_26 [L61] var_1_27 = var_1_28 [L62] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L63] COND TRUE (var_1_23 + (- var_1_24)) == var_1_32 [L64] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=31/2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L66] var_1_33 = var_1_24 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L67] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L68] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L72] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L73] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L78] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=-65538, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L79] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L80] COND TRUE \read(var_1_16) [L81] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L88] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L89] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L95] COND TRUE var_1_12 >= (1.3 / var_1_3) [L96] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L100] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L101] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L102] COND TRUE stepLocal_1 || var_1_16 [L103] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L106] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L106] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L106] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L165-L166] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=65406, var_1_20=32831, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=-65538, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 185 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3127 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3114 mSDsluCounter, 6473 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5218 mSDsCounter, 1177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6574 IncrementalHoareTripleChecker+Invalid, 7751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1177 mSolverCounterUnsat, 1255 mSDtfsCounter, 6574 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1707 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5975 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731occurred in iteration=8, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 671 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2612 ConstructedInterpolants, 0 QuantifiedInterpolants, 17439 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2201 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 21513/22736 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:55:41,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:55:43,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:55:43,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:55:43,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:55:43,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:55:43,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:55:43,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:55:43,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:55:43,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:55:43,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:55:43,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:55:43,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:55:43,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:55:43,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:55:43,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:55:43,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:55:43,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:43,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:55:43,711 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2025-03-16 23:55:43,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:55:43,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:55:43,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:55:43,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:55:43,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:55:43,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:45,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc15d34c/0f231639060d4c7caebe1e9a5e47f025/FLAG1fa542277 [2025-03-16 23:55:45,308 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:55:45,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:45,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc15d34c/0f231639060d4c7caebe1e9a5e47f025/FLAG1fa542277 [2025-03-16 23:55:45,330 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc15d34c/0f231639060d4c7caebe1e9a5e47f025 [2025-03-16 23:55:45,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:55:45,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:55:45,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:45,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:55:45,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:55:45,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c4bd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45, skipping insertion in model container [2025-03-16 23:55:45,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:55:45,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i[915,928] [2025-03-16 23:55:45,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:45,546 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:55:45,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i[915,928] [2025-03-16 23:55:45,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:45,599 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:55:45,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45 WrapperNode [2025-03-16 23:55:45,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:45,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:45,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:55:45,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:55:45,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,646 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-03-16 23:55:45,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:45,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:55:45,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:55:45,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:55:45,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:55:45,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,682 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:55:45,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:55:45,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:55:45,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:55:45,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (1/1) ... [2025-03-16 23:55:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:45,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:55:45,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:55:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:55:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:55:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:55:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:55:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:55:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:55:45,809 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:55:45,810 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:55:59,152 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:55:59,152 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:55:59,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:55:59,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:55:59,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:59 BoogieIcfgContainer [2025-03-16 23:55:59,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:55:59,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:55:59,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:55:59,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:55:59,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:55:45" (1/3) ... [2025-03-16 23:55:59,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ccf411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:59, skipping insertion in model container [2025-03-16 23:55:59,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:45" (2/3) ... [2025-03-16 23:55:59,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ccf411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:59, skipping insertion in model container [2025-03-16 23:55:59,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:59" (3/3) ... [2025-03-16 23:55:59,167 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-16 23:55:59,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:55:59,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:55:59,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:55:59,232 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;@53b2d321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:55:59,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:55:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:55:59,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:55:59,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:59,247 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:55:59,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:59,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1807327715, now seen corresponding path program 1 times [2025-03-16 23:55:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:55:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239623796] [2025-03-16 23:55:59,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:59,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:55:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:55:59,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:55:59,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 23:55:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:56:00,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:56:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:00,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:56:00,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:56:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 23:56:00,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:56:00,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:56:00,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239623796] [2025-03-16 23:56:00,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239623796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:00,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:00,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:56:00,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536025885] [2025-03-16 23:56:00,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:00,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:56:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:56:00,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:56:00,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:56:00,187 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:56:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:00,213 INFO L93 Difference]: Finished difference Result 147 states and 261 transitions. [2025-03-16 23:56:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:56:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2025-03-16 23:56:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:00,220 INFO L225 Difference]: With dead ends: 147 [2025-03-16 23:56:00,221 INFO L226 Difference]: Without dead ends: 73 [2025-03-16 23:56:00,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:56:00,227 INFO L435 NwaCegarLoop]: 113 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, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:00,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:56:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-16 23:56:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-16 23:56:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-16 23:56:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2025-03-16 23:56:00,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 179 [2025-03-16 23:56:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:00,259 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2025-03-16 23:56:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-16 23:56:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2025-03-16 23:56:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:56:00,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:00,262 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:56:00,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:56:00,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:56:00,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:00,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1090984070, now seen corresponding path program 1 times [2025-03-16 23:56:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:56:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976381122] [2025-03-16 23:56:00,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:56:00,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:56:00,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:56:00,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 23:56:00,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:56:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:56:01,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:01,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:01,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:56:01,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:56:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-16 23:56:04,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:56:04,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:56:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976381122] [2025-03-16 23:56:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976381122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:56:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [418684507] [2025-03-16 23:56:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:04,891 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-16 23:56:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-16 23:56:04,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-16 23:56:04,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-16 23:56:04,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:56:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:56:07,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:07,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:07,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 23:56:07,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:56:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:56:10,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:56:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [418684507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:56:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 23:56:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677445008] [2025-03-16 23:56:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:56:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:56:10,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:56:10,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:56:10,636 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:56:15,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:56:19,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:56:23,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:56:26,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:56:30,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:56:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:56:31,024 INFO L93 Difference]: Finished difference Result 350 states and 541 transitions. [2025-03-16 23:56:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 23:56:31,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2025-03-16 23:56:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:56:31,032 INFO L225 Difference]: With dead ends: 350 [2025-03-16 23:56:31,032 INFO L226 Difference]: Without dead ends: 278 [2025-03-16 23:56:31,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:56:31,034 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 263 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 181 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:56:31,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 602 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 20.0s Time] [2025-03-16 23:56:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-16 23:56:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 155. [2025-03-16 23:56:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-16 23:56:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-03-16 23:56:31,071 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 179 [2025-03-16 23:56:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:56:31,071 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-03-16 23:56:31,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-16 23:56:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-03-16 23:56:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 23:56:31,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:56:31,073 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:56:31,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:56:31,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 23:56:31,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:56:31,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:56:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:56:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 797581063, now seen corresponding path program 1 times [2025-03-16 23:56:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:56:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203777374] [2025-03-16 23:56:31,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:56:31,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:56:31,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:56:31,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:56:31,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 23:56:31,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 23:56:32,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 23:56:32,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:56:32,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:56:32,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 23:56:32,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:56:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-16 23:56:42,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:56:42,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:56:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203777374] [2025-03-16 23:56:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203777374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:56:42,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:56:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:56:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326845461] [2025-03-16 23:56:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:56:42,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:56:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:56:42,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:56:42,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:56:42,093 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29)