./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 798a7b37 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-?-798a7b3-m [2025-03-03 19:36:49,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:36:49,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:36:49,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:36:49,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:36:49,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:36:49,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:36:49,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:36:49,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:36:49,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:36:49,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:36:49,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:36:49,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:36:49,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:36:49,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:36:49,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:36:49,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:36:49,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:36:49,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:36:49,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:36:49,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:36:49,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:36:49,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:36:49,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:36:49,469 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-03 19:36:49,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:36:49,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:36:49,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:36:49,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:36:49,705 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:36:49,707 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-03 19:36:50,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b5538f4/e099f8bd968744249c7023c74590038d/FLAG7ae0d3e13 [2025-03-03 19:36:51,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:36:51,035 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-03 19:36:51,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b5538f4/e099f8bd968744249c7023c74590038d/FLAG7ae0d3e13 [2025-03-03 19:36:51,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b5538f4/e099f8bd968744249c7023c74590038d [2025-03-03 19:36:51,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:36:51,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:36:51,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:36:51,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:36:51,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:36:51,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afa7e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51, skipping insertion in model container [2025-03-03 19:36:51,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:36:51,502 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-03 19:36:51,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:36:51,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:36:51,580 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-03 19:36:51,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:36:51,633 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:36:51,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51 WrapperNode [2025-03-03 19:36:51,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:36:51,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:36:51,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:36:51,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:36:51,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,680 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2025-03-03 19:36:51,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:36:51,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:36:51,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:36:51,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:36:51,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,715 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-03 19:36:51,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:36:51,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:36:51,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:36:51,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:36:51,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (1/1) ... [2025-03-03 19:36:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:36:51,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:51,756 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-03 19:36:51,758 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-03 19:36:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:36:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:36:51,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:36:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:36:51,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:36:51,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:36:51,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:36:52,175 INFO L1325 $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-03 19:36:52,218 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 19:36:52,218 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:36:52,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:36:52,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:36:52,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:36:52 BoogieIcfgContainer [2025-03-03 19:36:52,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:36:52,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:36:52,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:36:52,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:36:52,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:36:51" (1/3) ... [2025-03-03 19:36:52,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:36:52, skipping insertion in model container [2025-03-03 19:36:52,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:36:51" (2/3) ... [2025-03-03 19:36:52,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a192f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:36:52, skipping insertion in model container [2025-03-03 19:36:52,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:36:52" (3/3) ... [2025-03-03 19:36:52,245 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-03 19:36:52,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:36:52,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:36:52,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:36:52,315 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;@53c7d263, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:36:52,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:36:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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-03 19:36:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 19:36:52,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:52,332 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-03 19:36:52,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1122147310, now seen corresponding path program 1 times [2025-03-03 19:36:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451564251] [2025-03-03 19:36:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:52,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 19:36:52,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 19:36:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:52,614 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-03 19:36:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451564251] [2025-03-03 19:36:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451564251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:36:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031860249] [2025-03-03 19:36:52,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:52,619 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-03 19:36:52,621 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-03 19:36:52,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 19:36:52,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 19:36:52,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:52,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:52,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:36:52,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:52,844 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-03 19:36:52,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:36:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031860249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:52,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:36:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:36:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776377991] [2025-03-03 19:36:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:36:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:52,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:36:52,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:36:52,867 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03 19:36:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:52,898 INFO L93 Difference]: Finished difference Result 200 states and 344 transitions. [2025-03-03 19:36:52,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:36:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 187 [2025-03-03 19:36:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:52,903 INFO L225 Difference]: With dead ends: 200 [2025-03-03 19:36:52,904 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 19:36:52,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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-03 19:36:52,913 INFO L435 NwaCegarLoop]: 147 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, 147 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-03 19:36:52,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:36:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 19:36:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 19:36:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 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-03 19:36:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2025-03-03 19:36:52,946 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 187 [2025-03-03 19:36:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2025-03-03 19:36:52,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-03 19:36:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2025-03-03 19:36:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 19:36:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:52,951 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-03 19:36:52,957 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-03 19:36:53,151 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-03 19:36:53,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2008135058, now seen corresponding path program 1 times [2025-03-03 19:36:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2190342] [2025-03-03 19:36:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:53,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 19:36:53,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 19:36:53,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:53,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:53,793 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-03 19:36:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2190342] [2025-03-03 19:36:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2190342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:36:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807614152] [2025-03-03 19:36:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:36:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:36:53,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:36:53,796 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 19:36:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:54,151 INFO L93 Difference]: Finished difference Result 423 states and 639 transitions. [2025-03-03 19:36:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:36:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 188 [2025-03-03 19:36:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:54,154 INFO L225 Difference]: With dead ends: 423 [2025-03-03 19:36:54,154 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 19:36:54,155 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-03 19:36:54,158 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 316 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 570 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-03 19:36:54,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 570 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:36:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 19:36:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 207. [2025-03-03 19:36:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 146 states have internal predecessors, (197), 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-03 19:36:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 313 transitions. [2025-03-03 19:36:54,182 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 313 transitions. Word has length 188 [2025-03-03 19:36:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:54,182 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 313 transitions. [2025-03-03 19:36:54,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 19:36:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 313 transitions. [2025-03-03 19:36:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 19:36:54,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:54,184 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-03 19:36:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:36:54,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:54,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1163663187, now seen corresponding path program 1 times [2025-03-03 19:36:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273976199] [2025-03-03 19:36:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 19:36:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 19:36:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:54,595 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-03 19:36:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273976199] [2025-03-03 19:36:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273976199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:36:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729754997] [2025-03-03 19:36:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:54,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:36:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:36:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:36:54,597 INFO L87 Difference]: Start difference. First operand 207 states and 313 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03 19:36:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:54,817 INFO L93 Difference]: Finished difference Result 402 states and 605 transitions. [2025-03-03 19:36:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:36:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 188 [2025-03-03 19:36:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:54,819 INFO L225 Difference]: With dead ends: 402 [2025-03-03 19:36:54,819 INFO L226 Difference]: Without dead ends: 198 [2025-03-03 19:36:54,820 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-03 19:36:54,821 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 405 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-03 19:36:54,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 405 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:36:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-03 19:36:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2025-03-03 19:36:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 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-03 19:36:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2025-03-03 19:36:54,854 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 188 [2025-03-03 19:36:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:54,855 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2025-03-03 19:36:54,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-03 19:36:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2025-03-03 19:36:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 19:36:54,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:54,857 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-03 19:36:54,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:36:54,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:54,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash -200014287, now seen corresponding path program 1 times [2025-03-03 19:36:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:54,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528306729] [2025-03-03 19:36:54,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:54,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 19:36:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 19:36:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:55,176 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-03 19:36:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528306729] [2025-03-03 19:36:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528306729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:55,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:36:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802104748] [2025-03-03 19:36:55,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:36:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:55,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:36:55,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:36:55,179 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03 19:36:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:55,628 INFO L93 Difference]: Finished difference Result 473 states and 715 transitions. [2025-03-03 19:36:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:36:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 190 [2025-03-03 19:36:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:55,633 INFO L225 Difference]: With dead ends: 473 [2025-03-03 19:36:55,633 INFO L226 Difference]: Without dead ends: 376 [2025-03-03 19:36:55,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03 19:36:55,636 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 179 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:55,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 643 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:36:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-03 19:36:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 304. [2025-03-03 19:36:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 213 states have internal predecessors, (280), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 19:36:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 454 transitions. [2025-03-03 19:36:55,672 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 454 transitions. Word has length 190 [2025-03-03 19:36:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:55,672 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 454 transitions. [2025-03-03 19:36:55,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-03 19:36:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 454 transitions. [2025-03-03 19:36:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 19:36:55,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:55,674 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, 1] [2025-03-03 19:36:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:36:55,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:55,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1605475855, now seen corresponding path program 1 times [2025-03-03 19:36:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316257510] [2025-03-03 19:36:55,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:55,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 19:36:55,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 19:36:55,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:55,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:55,906 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-03 19:36:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316257510] [2025-03-03 19:36:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316257510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:36:55,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:36:55,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:36:55,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052811458] [2025-03-03 19:36:55,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:36:55,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:36:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:55,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:36:55,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:36:55,908 INFO L87 Difference]: Start difference. First operand 304 states and 454 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03 19:36:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:36:56,171 INFO L93 Difference]: Finished difference Result 821 states and 1231 transitions. [2025-03-03 19:36:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:36:56,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 191 [2025-03-03 19:36:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:36:56,175 INFO L225 Difference]: With dead ends: 821 [2025-03-03 19:36:56,175 INFO L226 Difference]: Without dead ends: 602 [2025-03-03 19:36:56,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03 19:36:56,176 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 294 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:36:56,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 662 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:36:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-03 19:36:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 431. [2025-03-03 19:36:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 328 states have (on average 1.353658536585366) internal successors, (444), 329 states have internal predecessors, (444), 97 states have call successors, (97), 5 states have call predecessors, (97), 5 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 19:36:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 638 transitions. [2025-03-03 19:36:56,228 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 638 transitions. Word has length 191 [2025-03-03 19:36:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:36:56,229 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 638 transitions. [2025-03-03 19:36:56,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-03 19:36:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 638 transitions. [2025-03-03 19:36:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 19:36:56,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:36:56,231 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, 1] [2025-03-03 19:36:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:36:56,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:36:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:36:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash 331576460, now seen corresponding path program 1 times [2025-03-03 19:36:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:36:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071218108] [2025-03-03 19:36:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:36:56,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 19:36:56,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 19:36:56,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:56,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:57,099 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-03 19:36:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:36:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071218108] [2025-03-03 19:36:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071218108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:36:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003438284] [2025-03-03 19:36:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:36:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:36:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:36:57,102 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-03 19:36:57,103 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-03 19:36:57,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 19:36:57,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 19:36:57,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:36:57,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:36:57,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 19:36:57,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:58,716 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-03 19:36:58,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:36:59,825 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-03 19:36:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003438284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:36:59,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:36:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 36 [2025-03-03 19:36:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616845570] [2025-03-03 19:36:59,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:36:59,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 19:36:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:36:59,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 19:36:59,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 19:36:59,828 INFO L87 Difference]: Start difference. First operand 431 states and 638 transitions. Second operand has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) [2025-03-03 19:37:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:03,837 INFO L93 Difference]: Finished difference Result 1159 states and 1632 transitions. [2025-03-03 19:37:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-03 19:37:03,838 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) Word has length 191 [2025-03-03 19:37:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:03,842 INFO L225 Difference]: With dead ends: 1159 [2025-03-03 19:37:03,842 INFO L226 Difference]: Without dead ends: 815 [2025-03-03 19:37:03,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3639 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2515, Invalid=9041, Unknown=0, NotChecked=0, Total=11556 [2025-03-03 19:37:03,846 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1292 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:03,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1737 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 19:37:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-03 19:37:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 611. [2025-03-03 19:37:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 456 states have (on average 1.2675438596491229) internal successors, (578), 459 states have internal predecessors, (578), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 19:37:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 834 transitions. [2025-03-03 19:37:03,910 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 834 transitions. Word has length 191 [2025-03-03 19:37:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:03,911 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 834 transitions. [2025-03-03 19:37:03,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) [2025-03-03 19:37:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 834 transitions. [2025-03-03 19:37:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 19:37:03,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:03,914 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, 1, 1] [2025-03-03 19:37:03,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:37:04,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 19:37:04,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:04,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -352332815, now seen corresponding path program 1 times [2025-03-03 19:37:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90752369] [2025-03-03 19:37:04,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:04,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 19:37:04,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 19:37:04,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:04,240 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-03 19:37:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90752369] [2025-03-03 19:37:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90752369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:04,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:37:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041871432] [2025-03-03 19:37:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:04,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:37:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:04,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:37:04,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:37:04,242 INFO L87 Difference]: Start difference. First operand 611 states and 834 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03 19:37:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:04,390 INFO L93 Difference]: Finished difference Result 1138 states and 1570 transitions. [2025-03-03 19:37:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:37:04,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 192 [2025-03-03 19:37:04,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:04,396 INFO L225 Difference]: With dead ends: 1138 [2025-03-03 19:37:04,397 INFO L226 Difference]: Without dead ends: 896 [2025-03-03 19:37:04,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 19:37:04,398 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 129 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:04,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 575 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:37:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-03 19:37:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 678. [2025-03-03 19:37:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 523 states have (on average 1.2638623326959848) internal successors, (661), 526 states have internal predecessors, (661), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 19:37:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 917 transitions. [2025-03-03 19:37:04,459 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 917 transitions. Word has length 192 [2025-03-03 19:37:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:04,459 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 917 transitions. [2025-03-03 19:37:04,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03 19:37:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 917 transitions. [2025-03-03 19:37:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 19:37:04,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:04,460 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, 1, 1] [2025-03-03 19:37:04,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:37:04,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:04,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1514404679, now seen corresponding path program 1 times [2025-03-03 19:37:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718934906] [2025-03-03 19:37:04,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:04,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 19:37:04,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 19:37:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:04,778 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-03 19:37:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718934906] [2025-03-03 19:37:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718934906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:04,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828818544] [2025-03-03 19:37:04,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:04,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:04,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:04,781 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-03 19:37:04,783 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-03 19:37:04,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 19:37:04,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 19:37:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:04,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 19:37:04,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 268 proven. 150 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-03-03 19:37:05,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:37:05,794 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-03 19:37:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828818544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:37:05,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:37:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2025-03-03 19:37:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826510647] [2025-03-03 19:37:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:37:05,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 19:37:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 19:37:05,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:37:05,795 INFO L87 Difference]: Start difference. First operand 678 states and 917 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-03-03 19:37:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:06,484 INFO L93 Difference]: Finished difference Result 1185 states and 1603 transitions. [2025-03-03 19:37:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 19:37:06,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) Word has length 192 [2025-03-03 19:37:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:06,489 INFO L225 Difference]: With dead ends: 1185 [2025-03-03 19:37:06,489 INFO L226 Difference]: Without dead ends: 610 [2025-03-03 19:37:06,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2025-03-03 19:37:06,491 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:06,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1083 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:37:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-03 19:37:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 585. [2025-03-03 19:37:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 430 states have (on average 1.241860465116279) internal successors, (534), 433 states have internal predecessors, (534), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 19:37:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 790 transitions. [2025-03-03 19:37:06,560 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 790 transitions. Word has length 192 [2025-03-03 19:37:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:06,561 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 790 transitions. [2025-03-03 19:37:06,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-03-03 19:37:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 790 transitions. [2025-03-03 19:37:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 19:37:06,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:06,562 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, 1, 1, 1] [2025-03-03 19:37:06,570 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-03 19:37:06,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:06,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:06,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1279269518, now seen corresponding path program 1 times [2025-03-03 19:37:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:06,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370909405] [2025-03-03 19:37:06,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:06,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:06,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:06,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:06,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 66 proven. 168 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-03-03 19:37:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:07,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370909405] [2025-03-03 19:37:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370909405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:07,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112236010] [2025-03-03 19:37:07,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:07,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:07,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:07,201 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-03 19:37:07,203 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-03 19:37:07,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:07,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:07,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:07,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:07,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 19:37:07,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:08,054 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-03 19:37:08,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:37:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112236010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:08,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:37:08,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 18 [2025-03-03 19:37:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809309907] [2025-03-03 19:37:08,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:37:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 19:37:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:08,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 19:37:08,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:37:08,660 INFO L87 Difference]: Start difference. First operand 585 states and 790 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-03-03 19:37:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:09,822 INFO L93 Difference]: Finished difference Result 1204 states and 1603 transitions. [2025-03-03 19:37:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-03 19:37:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 193 [2025-03-03 19:37:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:09,826 INFO L225 Difference]: With dead ends: 1204 [2025-03-03 19:37:09,826 INFO L226 Difference]: Without dead ends: 955 [2025-03-03 19:37:09,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=2679, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 19:37:09,828 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 726 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:09,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 753 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:37:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-03 19:37:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 678. [2025-03-03 19:37:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 485 states have (on average 1.1958762886597938) internal successors, (580), 488 states have internal predecessors, (580), 155 states have call successors, (155), 37 states have call predecessors, (155), 37 states have return successors, (155), 152 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-03 19:37:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 890 transitions. [2025-03-03 19:37:09,892 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 890 transitions. Word has length 193 [2025-03-03 19:37:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 890 transitions. [2025-03-03 19:37:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-03-03 19:37:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 890 transitions. [2025-03-03 19:37:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 19:37:09,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:09,893 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, 1, 1, 1] [2025-03-03 19:37:09,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:37:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:10,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1272004322, now seen corresponding path program 1 times [2025-03-03 19:37:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045474257] [2025-03-03 19:37:10,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:10,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:10,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:37:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166178396] [2025-03-03 19:37:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:10,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:10,152 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-03 19:37:10,153 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-03 19:37:10,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:10,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:10,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:10,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:37:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:10,694 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-03 19:37:10,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:37:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:37:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045474257] [2025-03-03 19:37:10,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:37:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166178396] [2025-03-03 19:37:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166178396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:10,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:37:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-03 19:37:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283376619] [2025-03-03 19:37:10,929 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:37:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:37:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:37:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:37:10,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:37:10,930 INFO L87 Difference]: Start difference. First operand 678 states and 890 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:37:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:11,159 INFO L93 Difference]: Finished difference Result 1271 states and 1669 transitions. [2025-03-03 19:37:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:37:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 193 [2025-03-03 19:37:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:11,162 INFO L225 Difference]: With dead ends: 1271 [2025-03-03 19:37:11,162 INFO L226 Difference]: Without dead ends: 696 [2025-03-03 19:37:11,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:37:11,165 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 95 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:37:11,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 456 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:37:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-03 19:37:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 680. [2025-03-03 19:37:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 487 states have (on average 1.1950718685831623) internal successors, (582), 490 states have internal predecessors, (582), 155 states have call successors, (155), 37 states have call predecessors, (155), 37 states have return successors, (155), 152 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-03 19:37:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 892 transitions. [2025-03-03 19:37:11,230 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 892 transitions. Word has length 193 [2025-03-03 19:37:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 892 transitions. [2025-03-03 19:37:11,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 19:37:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 892 transitions. [2025-03-03 19:37:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 19:37:11,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:11,232 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, 1, 1, 1] [2025-03-03 19:37:11,239 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-03 19:37:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 19:37:11,433 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2135459293, now seen corresponding path program 1 times [2025-03-03 19:37:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:37:11,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58790120] [2025-03-03 19:37:11,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:37:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:37:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413658498] [2025-03-03 19:37:11,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:11,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:11,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:11,484 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-03 19:37:11,486 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-03 19:37:11,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:11,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:11,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:37:11,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:37:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 19:37:11,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 19:37:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:37:11,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:37:11,740 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:37:11,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:37:11,750 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-03 19:37:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:37:11,945 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:37:12,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:37:12,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:37:12 BoogieIcfgContainer [2025-03-03 19:37:12,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:37:12,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:37:12,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:37:12,042 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:37:12,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:36:52" (3/4) ... [2025-03-03 19:37:12,044 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:37:12,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:37:12,045 INFO L158 Benchmark]: Toolchain (without parser) took 20662.31ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.4MB in the beginning and 148.0MB in the end (delta: -25.6MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. [2025-03-03 19:37:12,045 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:12,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.79ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 106.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:37:12,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:12,046 INFO L158 Benchmark]: Boogie Preprocessor took 45.45ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 96.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:37:12,046 INFO L158 Benchmark]: IcfgBuilder took 509.18ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 66.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 19:37:12,046 INFO L158 Benchmark]: TraceAbstraction took 19803.35ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 65.2MB in the beginning and 148.0MB in the end (delta: -82.8MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2025-03-03 19:37:12,047 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 352.3MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:37:12,047 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.24ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.79ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 106.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.37ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.45ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 96.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 509.18ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 66.1MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19803.35ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 65.2MB in the beginning and 148.0MB in the end (delta: -82.8MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 352.3MB. Free memory is still 148.0MB. 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 134, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of bitwiseOr at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 63. 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; VAL [isInitial=0, 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_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [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 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_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [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=49022, var_1_20=16447, 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=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3297 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3283 mSDsluCounter, 7031 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5293 mSDsCounter, 1419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5678 IncrementalHoareTripleChecker+Invalid, 7097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1419 mSolverCounterUnsat, 1738 mSDtfsCounter, 5678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1809 GetRequests, 1587 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4733 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=10, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 3247 NumberOfCodeBlocks, 3247 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 19116 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2221 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 24755/25984 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-03 19:37:12,093 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-?-798a7b3-m [2025-03-03 19:37:13,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:37:13,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:37:13,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:37:13,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:37:13,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:37:13,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:37:13,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:37:13,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:37:13,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:37:13,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:37:13,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:37:13,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:37:13,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:37:13,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:37:13,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:37:13,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:37:13,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:37:13,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:37:13,970 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-03 19:37:14,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:37:14,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:37:14,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:37:14,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:37:14,266 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:37:14,267 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-03 19:37:15,378 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50dfc15f/334a3d6b6eeb4322bb4d795b38990f05/FLAGba9e21ead [2025-03-03 19:37:15,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:37:15,575 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-03 19:37:15,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50dfc15f/334a3d6b6eeb4322bb4d795b38990f05/FLAGba9e21ead [2025-03-03 19:37:15,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50dfc15f/334a3d6b6eeb4322bb4d795b38990f05 [2025-03-03 19:37:15,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:37:15,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:37:15,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:15,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:37:15,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:37:15,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:15" (1/1) ... [2025-03-03 19:37:15,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240e7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:15, skipping insertion in model container [2025-03-03 19:37:15,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:37:15" (1/1) ... [2025-03-03 19:37:15,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:37:16,060 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-03 19:37:16,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:16,125 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:37:16,133 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-03 19:37:16,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:37:16,176 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:37:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16 WrapperNode [2025-03-03 19:37:16,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:37:16,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:16,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:37:16,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:37:16,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,216 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-03-03 19:37:16,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:37:16,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:37:16,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:37:16,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:37:16,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,246 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-03 19:37:16,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:37:16,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:37:16,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:37:16,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:37:16,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (1/1) ... [2025-03-03 19:37:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:37:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:37:16,293 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-03 19:37:16,297 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-03 19:37:16,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:37:16,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:37:16,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:37:16,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:37:16,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:37:16,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:37:16,386 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:37:16,388 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:37:30,013 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:37:30,013 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:37:30,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:37:30,020 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:37:30,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:30 BoogieIcfgContainer [2025-03-03 19:37:30,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:37:30,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:37:30,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:37:30,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:37:30,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:37:15" (1/3) ... [2025-03-03 19:37:30,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36097195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:30, skipping insertion in model container [2025-03-03 19:37:30,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:37:16" (2/3) ... [2025-03-03 19:37:30,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36097195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:37:30, skipping insertion in model container [2025-03-03 19:37:30,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:37:30" (3/3) ... [2025-03-03 19:37:30,027 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-03-03 19:37:30,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:37:30,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:37:30,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:37:30,080 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;@6da9e3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:37:30,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:37:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 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-03 19:37:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:37:30,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:30,094 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] [2025-03-03 19:37:30,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1067707309, now seen corresponding path program 1 times [2025-03-03 19:37:30,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:37:30,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555848144] [2025-03-03 19:37:30,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:30,110 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-03 19:37:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:37:30,114 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-03 19:37:30,116 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-03 19:37:30,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:37:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:37:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:30,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:37:30,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-03-03 19:37:30,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:30,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:37:30,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555848144] [2025-03-03 19:37:30,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555848144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:30,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:37:30,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:37:30,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140436751] [2025-03-03 19:37:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:37:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:37:31,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:37:31,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:37:31,010 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 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.5) internal successors, (45), 2 states have internal predecessors, (45), 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-03 19:37:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:37:31,027 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2025-03-03 19:37:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:37:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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 183 [2025-03-03 19:37:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:37:31,033 INFO L225 Difference]: With dead ends: 154 [2025-03-03 19:37:31,033 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 19:37:31,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:37:31,036 INFO L435 NwaCegarLoop]: 117 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, 117 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-03 19:37:31,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:37:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 19:37:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 19:37:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 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-03 19:37:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-03 19:37:31,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 183 [2025-03-03 19:37:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:37:31,072 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-03 19:37:31,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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-03 19:37:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-03 19:37:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:37:31,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:37:31,075 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] [2025-03-03 19:37:31,094 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 19:37:31,275 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-03 19:37:31,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:37:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:37:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 335890794, now seen corresponding path program 1 times [2025-03-03 19:37:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:37:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877100119] [2025-03-03 19:37:31,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:31,277 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-03 19:37:31,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:37:31,278 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-03 19:37:31,279 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-03 19:37:31,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:37:32,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:37:32,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:32,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:32,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:37:32,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:35,112 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-03 19:37:35,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:37:35,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:37:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877100119] [2025-03-03 19:37:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877100119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:37:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1963702785] [2025-03-03 19:37:35,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:37:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:37:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:37:35,635 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-03 19:37:35,636 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-03 19:37:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:37:37,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:37:37,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:37:37,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:37:37,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:37:37,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:37:40,830 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-03 19:37:40,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:37:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1963702785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:37:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:37:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-03 19:37:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026540926] [2025-03-03 19:37:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:37:40,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:37:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:37:40,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:37:40,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:37:40,833 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-03 19:37:45,727 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-03 19:37:49,732 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-03 19:37:53,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:37:56,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:38:00,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:38:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:00,880 INFO L93 Difference]: Finished difference Result 362 states and 553 transitions. [2025-03-03 19:38:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:38:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 183 [2025-03-03 19:38:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:00,884 INFO L225 Difference]: With dead ends: 362 [2025-03-03 19:38:00,884 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 19:38:00,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 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-03 19:38:00,885 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 275 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 181 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:00,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 616 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2025-03-03 19:38:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 19:38:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 161. [2025-03-03 19:38:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-03 19:38:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2025-03-03 19:38:00,916 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 183 [2025-03-03 19:38:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:00,917 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2025-03-03 19:38:00,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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-03 19:38:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2025-03-03 19:38:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 19:38:00,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:00,919 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] [2025-03-03 19:38:00,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 19:38:01,142 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-03 19:38:01,319 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-03 19:38:01,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:01,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash -169667831, now seen corresponding path program 1 times [2025-03-03 19:38:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:38:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423862073] [2025-03-03 19:38:01,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:01,321 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-03 19:38:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:38:01,324 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-03 19:38:01,326 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-03 19:38:01,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 19:38:02,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 19:38:02,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:02,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:02,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:38:02,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:12,175 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-03 19:38:12,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:12,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:38:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423862073] [2025-03-03 19:38:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423862073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:12,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:38:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:38:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415890029] [2025-03-03 19:38:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:38:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:38:12,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:38:12,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:38:12,177 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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-03 19:38:16,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:38:20,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []