./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:29:22,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:29:22,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:29:22,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:29:22,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:29:22,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:29:22,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:29:22,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:29:22,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:29:22,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:29:22,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:29:22,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:29:22,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:29:22,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:29:22,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:29:22,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:29:22,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:29:22,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:29:22,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:29:22,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:29:22,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:29:22,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:29:22,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:29:22,657 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2025-02-05 23:29:22,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:29:22,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:29:22,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:29:22,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:29:22,886 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:29:22,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:29:24,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae29a29bc/604727d1b9ae4f3db7052758065f9cdc/FLAG5cda9e0e6 [2025-02-05 23:29:24,447 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:29:24,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:29:24,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae29a29bc/604727d1b9ae4f3db7052758065f9cdc/FLAG5cda9e0e6 [2025-02-05 23:29:24,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae29a29bc/604727d1b9ae4f3db7052758065f9cdc [2025-02-05 23:29:24,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:29:24,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:29:24,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:29:24,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:29:24,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:29:24,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e136d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24, skipping insertion in model container [2025-02-05 23:29:24,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:29:24,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-02-05 23:29:24,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:29:24,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:29:24,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-02-05 23:29:24,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:29:24,760 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:29:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24 WrapperNode [2025-02-05 23:29:24,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:29:24,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:29:24,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:29:24,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:29:24,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,818 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-02-05 23:29:24,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:29:24,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:29:24,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:29:24,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:29:24,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,843 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-02-05 23:29:24,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:29:24,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:29:24,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:29:24,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:29:24,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (1/1) ... [2025-02-05 23:29:24,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:29:24,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:29:24,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:29:24,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:29:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:29:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:29:24,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:29:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:29:24,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:29:24,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:29:24,975 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:29:24,977 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:29:25,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise26#1; [2025-02-05 23:29:25,399 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:29:25,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:29:25,421 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:29:25,421 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:29:25,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:29:25 BoogieIcfgContainer [2025-02-05 23:29:25,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:29:25,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:29:25,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:29:25,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:29:25,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:29:24" (1/3) ... [2025-02-05 23:29:25,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f63bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:29:25, skipping insertion in model container [2025-02-05 23:29:25,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:29:24" (2/3) ... [2025-02-05 23:29:25,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f63bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:29:25, skipping insertion in model container [2025-02-05 23:29:25,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:29:25" (3/3) ... [2025-02-05 23:29:25,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:29:25,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:29:25,446 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:29:25,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:29:25,496 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;@158ac8f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:29:25,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:29:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:29:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:29:25,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:25,510 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:25,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -889341081, now seen corresponding path program 1 times [2025-02-05 23:29:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491426821] [2025-02-05 23:29:25,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:25,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:29:25,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:29:25,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:25,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:29:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:29:25,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491426821] [2025-02-05 23:29:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491426821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:29:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351185777] [2025-02-05 23:29:25,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:25,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:29:25,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:29:25,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:29:25,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:29:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:29:26,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:29:26,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:26,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:26,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:29:26,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:29:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 23:29:26,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:29:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351185777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:29:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:29:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:29:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909591505] [2025-02-05 23:29:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:29:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:29:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:29:26,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:29:26,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:29:26,082 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:29:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:29:26,107 INFO L93 Difference]: Finished difference Result 204 states and 359 transitions. [2025-02-05 23:29:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:29:26,109 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2025-02-05 23:29:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:29:26,113 INFO L225 Difference]: With dead ends: 204 [2025-02-05 23:29:26,113 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 23:29:26,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:29:26,117 INFO L435 NwaCegarLoop]: 155 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, 155 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-02-05 23:29:26,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:29:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 23:29:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-05 23:29:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:29:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2025-02-05 23:29:26,152 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 217 [2025-02-05 23:29:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:29:26,152 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2025-02-05 23:29:26,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:29:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2025-02-05 23:29:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:29:26,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:26,156 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:26,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:29:26,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:29:26,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:26,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1440450631, now seen corresponding path program 1 times [2025-02-05 23:29:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614409229] [2025-02-05 23:29:26,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:29:26,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:29:26,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:26,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:29:27,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:29:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614409229] [2025-02-05 23:29:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614409229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:29:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:29:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:29:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103793881] [2025-02-05 23:29:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:29:27,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:29:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:29:27,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:29:27,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:29:27,786 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:29:28,584 INFO L93 Difference]: Finished difference Result 399 states and 630 transitions. [2025-02-05 23:29:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 23:29:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-02-05 23:29:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:29:28,588 INFO L225 Difference]: With dead ends: 399 [2025-02-05 23:29:28,588 INFO L226 Difference]: Without dead ends: 300 [2025-02-05 23:29:28,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:29:28,589 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 245 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:29:28,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 610 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:29:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-05 23:29:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 277. [2025-02-05 23:29:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 171 states have (on average 1.3625730994152048) internal successors, (233), 171 states have internal predecessors, (233), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 23:29:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 437 transitions. [2025-02-05 23:29:28,634 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 437 transitions. Word has length 217 [2025-02-05 23:29:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:29:28,634 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 437 transitions. [2025-02-05 23:29:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 437 transitions. [2025-02-05 23:29:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 23:29:28,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:28,637 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:29:28,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:28,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1785804633, now seen corresponding path program 1 times [2025-02-05 23:29:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765036777] [2025-02-05 23:29:28,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:28,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 23:29:28,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 23:29:28,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:28,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:29:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:29:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765036777] [2025-02-05 23:29:29,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765036777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:29:29,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:29:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:29:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196544328] [2025-02-05 23:29:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:29:29,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:29:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:29:29,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:29:29,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:29:29,115 INFO L87 Difference]: Start difference. First operand 277 states and 437 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:29:29,269 INFO L93 Difference]: Finished difference Result 377 states and 595 transitions. [2025-02-05 23:29:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:29:29,270 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-02-05 23:29:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:29:29,272 INFO L225 Difference]: With dead ends: 377 [2025-02-05 23:29:29,272 INFO L226 Difference]: Without dead ends: 278 [2025-02-05 23:29:29,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:29:29,273 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:29:29,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 222 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:29:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-05 23:29:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-05 23:29:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 172 states have (on average 1.3604651162790697) internal successors, (234), 172 states have internal predecessors, (234), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 23:29:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 438 transitions. [2025-02-05 23:29:29,310 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 438 transitions. Word has length 217 [2025-02-05 23:29:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:29:29,311 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 438 transitions. [2025-02-05 23:29:29,311 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 438 transitions. [2025-02-05 23:29:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 23:29:29,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:29,313 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:29:29,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1840341923, now seen corresponding path program 1 times [2025-02-05 23:29:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170773803] [2025-02-05 23:29:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:29,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 23:29:29,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 23:29:29,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:29,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:29:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:29:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170773803] [2025-02-05 23:29:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170773803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:29:30,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:29:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:29:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165047323] [2025-02-05 23:29:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:29:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:29:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:29:30,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:29:30,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:29:30,147 INFO L87 Difference]: Start difference. First operand 278 states and 438 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:29:31,098 INFO L93 Difference]: Finished difference Result 488 states and 768 transitions. [2025-02-05 23:29:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:29:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-02-05 23:29:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:29:31,101 INFO L225 Difference]: With dead ends: 488 [2025-02-05 23:29:31,101 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 23:29:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:29:31,103 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 213 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:29:31,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 717 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:29:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 23:29:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 290. [2025-02-05 23:29:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 184 states have (on average 1.375) internal successors, (253), 184 states have internal predecessors, (253), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 23:29:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2025-02-05 23:29:31,150 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 218 [2025-02-05 23:29:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:29:31,150 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2025-02-05 23:29:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2025-02-05 23:29:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 23:29:31,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:31,153 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:31,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:29:31,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 420791425, now seen corresponding path program 1 times [2025-02-05 23:29:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018531470] [2025-02-05 23:29:31,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:31,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:31,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 23:29:31,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 23:29:31,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:29:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:29:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:29:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018531470] [2025-02-05 23:29:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018531470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:29:32,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:29:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 23:29:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486160103] [2025-02-05 23:29:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:29:32,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 23:29:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:29:32,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 23:29:32,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:29:32,390 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:29:33,786 INFO L93 Difference]: Finished difference Result 727 states and 1139 transitions. [2025-02-05 23:29:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:29:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-02-05 23:29:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:29:33,790 INFO L225 Difference]: With dead ends: 727 [2025-02-05 23:29:33,790 INFO L226 Difference]: Without dead ends: 513 [2025-02-05 23:29:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:29:33,791 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 388 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:29:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 576 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:29:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-02-05 23:29:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 429. [2025-02-05 23:29:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 267 states have (on average 1.3408239700374531) internal successors, (358), 268 states have internal predecessors, (358), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 23:29:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 670 transitions. [2025-02-05 23:29:33,845 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 670 transitions. Word has length 218 [2025-02-05 23:29:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:29:33,846 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 670 transitions. [2025-02-05 23:29:33,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:29:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 670 transitions. [2025-02-05 23:29:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 23:29:33,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:29:33,848 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:29:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:29:33,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:29:33,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:29:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash 224277920, now seen corresponding path program 1 times [2025-02-05 23:29:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:29:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523458515] [2025-02-05 23:29:33,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:29:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:29:33,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 23:29:33,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 23:29:33,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:29:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:16,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523458515] [2025-02-05 23:30:16,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523458515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:16,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:16,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:30:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092437173] [2025-02-05 23:30:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:16,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:30:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:16,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:30:16,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:30:16,407 INFO L87 Difference]: Start difference. First operand 429 states and 670 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:18,413 INFO L93 Difference]: Finished difference Result 731 states and 1131 transitions. [2025-02-05 23:30:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:30:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-02-05 23:30:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:18,422 INFO L225 Difference]: With dead ends: 731 [2025-02-05 23:30:18,422 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 23:30:18,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:30:18,423 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:18,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 804 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:30:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 23:30:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 457. [2025-02-05 23:30:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 295 states have (on average 1.3288135593220338) internal successors, (392), 296 states have internal predecessors, (392), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 23:30:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 704 transitions. [2025-02-05 23:30:18,489 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 704 transitions. Word has length 218 [2025-02-05 23:30:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:18,489 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 704 transitions. [2025-02-05 23:30:18,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 704 transitions. [2025-02-05 23:30:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:18,491 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:18,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:30:18,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:18,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1202850269, now seen corresponding path program 1 times [2025-02-05 23:30:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711145884] [2025-02-05 23:30:18,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:18,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:18,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:18,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711145884] [2025-02-05 23:30:18,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711145884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:18,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:18,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:30:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202116519] [2025-02-05 23:30:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:18,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:30:18,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:18,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:30:18,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:30:18,959 INFO L87 Difference]: Start difference. First operand 457 states and 704 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:20,162 INFO L93 Difference]: Finished difference Result 1107 states and 1726 transitions. [2025-02-05 23:30:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:30:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 23:30:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:20,167 INFO L225 Difference]: With dead ends: 1107 [2025-02-05 23:30:20,167 INFO L226 Difference]: Without dead ends: 909 [2025-02-05 23:30:20,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 23:30:20,169 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 365 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:20,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1019 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:30:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-02-05 23:30:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 829. [2025-02-05 23:30:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 527 states have (on average 1.333965844402277) internal successors, (703), 528 states have internal predecessors, (703), 292 states have call successors, (292), 9 states have call predecessors, (292), 9 states have return successors, (292), 291 states have call predecessors, (292), 292 states have call successors, (292) [2025-02-05 23:30:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1287 transitions. [2025-02-05 23:30:20,252 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1287 transitions. Word has length 219 [2025-02-05 23:30:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:20,252 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1287 transitions. [2025-02-05 23:30:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1287 transitions. [2025-02-05 23:30:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:20,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:20,254 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:30:20,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -830983679, now seen corresponding path program 1 times [2025-02-05 23:30:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:20,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90760780] [2025-02-05 23:30:20,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:20,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:20,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:20,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90760780] [2025-02-05 23:30:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90760780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:20,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:20,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:30:20,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439300450] [2025-02-05 23:30:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:20,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:30:20,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:20,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:30:20,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:30:20,565 INFO L87 Difference]: Start difference. First operand 829 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:20,964 INFO L93 Difference]: Finished difference Result 1234 states and 1908 transitions. [2025-02-05 23:30:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:30:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 23:30:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:20,970 INFO L225 Difference]: With dead ends: 1234 [2025-02-05 23:30:20,970 INFO L226 Difference]: Without dead ends: 501 [2025-02-05 23:30:20,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:30:20,975 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 110 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:20,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 536 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:30:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-05 23:30:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 472. [2025-02-05 23:30:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 310 states have (on average 1.3419354838709678) internal successors, (416), 311 states have internal predecessors, (416), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 23:30:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 728 transitions. [2025-02-05 23:30:21,030 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 728 transitions. Word has length 219 [2025-02-05 23:30:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:21,030 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 728 transitions. [2025-02-05 23:30:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 728 transitions. [2025-02-05 23:30:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:21,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:21,036 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:21,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:30:21,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:21,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash 806713136, now seen corresponding path program 1 times [2025-02-05 23:30:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:21,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357331958] [2025-02-05 23:30:21,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:21,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:21,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:21,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:21,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357331958] [2025-02-05 23:30:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357331958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:30:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871979409] [2025-02-05 23:30:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:30:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:21,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:30:21,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:30:21,266 INFO L87 Difference]: Start difference. First operand 472 states and 728 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:21,551 INFO L93 Difference]: Finished difference Result 705 states and 1095 transitions. [2025-02-05 23:30:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:30:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 23:30:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:21,555 INFO L225 Difference]: With dead ends: 705 [2025-02-05 23:30:21,555 INFO L226 Difference]: Without dead ends: 498 [2025-02-05 23:30:21,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:30:21,557 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 98 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:21,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 405 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:30:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-05 23:30:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 480. [2025-02-05 23:30:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 318 states have (on average 1.3427672955974843) internal successors, (427), 319 states have internal predecessors, (427), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 23:30:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 739 transitions. [2025-02-05 23:30:21,607 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 739 transitions. Word has length 219 [2025-02-05 23:30:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:21,608 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 739 transitions. [2025-02-05 23:30:21,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 739 transitions. [2025-02-05 23:30:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:21,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:21,610 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:30:21,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:21,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1860860387, now seen corresponding path program 1 times [2025-02-05 23:30:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594754283] [2025-02-05 23:30:21,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:21,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:21,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:21,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:21,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594754283] [2025-02-05 23:30:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594754283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:21,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:21,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:30:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280604418] [2025-02-05 23:30:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:30:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:21,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:30:21,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:30:21,964 INFO L87 Difference]: Start difference. First operand 480 states and 739 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:22,536 INFO L93 Difference]: Finished difference Result 919 states and 1420 transitions. [2025-02-05 23:30:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:30:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 23:30:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:22,541 INFO L225 Difference]: With dead ends: 919 [2025-02-05 23:30:22,541 INFO L226 Difference]: Without dead ends: 819 [2025-02-05 23:30:22,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:30:22,542 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 439 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 334 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:30:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-05 23:30:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 581. [2025-02-05 23:30:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 384 states have (on average 1.3515625) internal successors, (519), 385 states have internal predecessors, (519), 190 states have call successors, (190), 6 states have call predecessors, (190), 6 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) [2025-02-05 23:30:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 899 transitions. [2025-02-05 23:30:22,610 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 899 transitions. Word has length 219 [2025-02-05 23:30:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:22,611 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 899 transitions. [2025-02-05 23:30:22,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 899 transitions. [2025-02-05 23:30:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:22,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:22,612 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:30:22,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:22,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 400272961, now seen corresponding path program 1 times [2025-02-05 23:30:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:22,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917700118] [2025-02-05 23:30:22,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:22,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:22,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917700118] [2025-02-05 23:30:22,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917700118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:22,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:22,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 23:30:22,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789961465] [2025-02-05 23:30:22,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:22,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 23:30:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:22,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 23:30:22,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:30:22,995 INFO L87 Difference]: Start difference. First operand 581 states and 899 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:23,778 INFO L93 Difference]: Finished difference Result 1073 states and 1653 transitions. [2025-02-05 23:30:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 23:30:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-02-05 23:30:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:23,784 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 23:30:23,784 INFO L226 Difference]: Without dead ends: 872 [2025-02-05 23:30:23,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:30:23,786 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 553 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:23,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 375 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:30:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-02-05 23:30:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 631. [2025-02-05 23:30:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 413 states have (on average 1.3389830508474576) internal successors, (553), 415 states have internal predecessors, (553), 210 states have call successors, (210), 7 states have call predecessors, (210), 7 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-02-05 23:30:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 973 transitions. [2025-02-05 23:30:23,863 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 973 transitions. Word has length 219 [2025-02-05 23:30:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:23,863 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 973 transitions. [2025-02-05 23:30:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 973 transitions. [2025-02-05 23:30:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 23:30:23,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:23,865 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:30:23,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash 203759456, now seen corresponding path program 1 times [2025-02-05 23:30:23,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736982376] [2025-02-05 23:30:23,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:23,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 23:30:23,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 23:30:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:23,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736982376] [2025-02-05 23:30:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736982376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 23:30:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175714595] [2025-02-05 23:30:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:24,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 23:30:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:24,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 23:30:24,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 23:30:24,282 INFO L87 Difference]: Start difference. First operand 631 states and 973 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 23:30:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:24,928 INFO L93 Difference]: Finished difference Result 1334 states and 2074 transitions. [2025-02-05 23:30:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:30:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 219 [2025-02-05 23:30:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:24,935 INFO L225 Difference]: With dead ends: 1334 [2025-02-05 23:30:24,935 INFO L226 Difference]: Without dead ends: 987 [2025-02-05 23:30:24,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:30:24,937 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 306 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:24,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 350 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:30:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-02-05 23:30:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 819. [2025-02-05 23:30:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 531 states have (on average 1.344632768361582) internal successors, (714), 533 states have internal predecessors, (714), 278 states have call successors, (278), 9 states have call predecessors, (278), 9 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-02-05 23:30:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1270 transitions. [2025-02-05 23:30:25,037 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1270 transitions. Word has length 219 [2025-02-05 23:30:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:25,037 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1270 transitions. [2025-02-05 23:30:25,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 23:30:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1270 transitions. [2025-02-05 23:30:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 23:30:25,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:25,038 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:25,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:30:25,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:25,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1858714896, now seen corresponding path program 1 times [2025-02-05 23:30:25,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:25,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065342043] [2025-02-05 23:30:25,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 23:30:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 23:30:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:30:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:30:25,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065342043] [2025-02-05 23:30:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065342043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:25,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:30:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796526339] [2025-02-05 23:30:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:25,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:30:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:30:25,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:30:25,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:30:25,099 INFO L87 Difference]: Start difference. First operand 819 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:25,279 INFO L93 Difference]: Finished difference Result 1753 states and 2701 transitions. [2025-02-05 23:30:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:30:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-02-05 23:30:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:25,285 INFO L225 Difference]: With dead ends: 1753 [2025-02-05 23:30:25,286 INFO L226 Difference]: Without dead ends: 1066 [2025-02-05 23:30:25,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:30:25,289 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:30:25,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 303 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:30:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-02-05 23:30:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1010. [2025-02-05 23:30:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 722 states have (on average 1.394736842105263) internal successors, (1007), 724 states have internal predecessors, (1007), 278 states have call successors, (278), 9 states have call predecessors, (278), 9 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-02-05 23:30:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1563 transitions. [2025-02-05 23:30:25,423 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1563 transitions. Word has length 220 [2025-02-05 23:30:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:25,423 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1563 transitions. [2025-02-05 23:30:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 23:30:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1563 transitions. [2025-02-05 23:30:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 23:30:25,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:25,424 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:25,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:30:25,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139696, now seen corresponding path program 1 times [2025-02-05 23:30:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:30:25,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518564981] [2025-02-05 23:30:25,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:30:25,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 23:30:25,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 23:30:25,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:25,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 23:30:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659043344] [2025-02-05 23:30:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:30:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:30:25,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:30:25,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:30:25,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 23:30:25,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 23:30:25,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:25,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:30:25,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:30:25,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 23:30:25,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 23:30:25,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:25,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:30:25,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:30:25,931 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:30:25,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:30:25,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:30:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:30:26,136 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:30:26,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:30:26,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:30:26 BoogieIcfgContainer [2025-02-05 23:30:26,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:30:26,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:30:26,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:30:26,255 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:30:26,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:29:25" (3/4) ... [2025-02-05 23:30:26,257 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:30:26,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:30:26,258 INFO L158 Benchmark]: Toolchain (without parser) took 61772.94ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 109.0MB in the beginning and 1.1GB in the end (delta: -986.7MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,258 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:30:26,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.94ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.65ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 88.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:30:26,259 INFO L158 Benchmark]: Boogie Preprocessor took 33.86ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 83.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,259 INFO L158 Benchmark]: IcfgBuilder took 566.56ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 51.8MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,259 INFO L158 Benchmark]: TraceAbstraction took 60829.09ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 51.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,260 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 115.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 23:30:26,261 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.94ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.65ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 88.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.86ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 83.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 566.56ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 51.8MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 60829.09ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 51.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 1.3GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 115.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 118, overapproximation of someBinaryArithmeticDOUBLEoperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 173, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of bitwiseAnd at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 183. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] float var_1_23 = 3.2; [L43] unsigned long int var_1_27 = 2686167646; [L44] float var_1_29 = 5.5; [L45] unsigned char var_1_30 = 16; [L46] unsigned char var_1_31 = 0; [L47] signed long int var_1_32 = -2; [L48] unsigned short int var_1_33 = 1; [L49] unsigned long int var_1_34 = 3877983372; [L50] double var_1_35 = 16.75; [L51] double var_1_36 = 0.0; [L52] double var_1_37 = 99999.6; [L53] float var_1_38 = 25.6; [L54] float var_1_39 = 8.75; [L55] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L135] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L136] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L137] var_1_5 = __VERIFIER_nondet_short() [L138] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L138] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L139] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L141] var_1_7 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L142] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L143] var_1_8 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L144] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L145] var_1_10 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L146] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L147] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L147] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L148] var_1_13 = __VERIFIER_nondet_short() [L149] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L149] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L150] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L151] var_1_14 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L152] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L153] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L153] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L154] var_1_15 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L155] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L156] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L156] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L157] var_1_16 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L159] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L159] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L161] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L162] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L162] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L163] var_1_20 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L165] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L165] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=10000, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L166] var_1_21 = __VERIFIER_nondet_short() [L167] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L167] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L168] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L168] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=2686167646, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L169] var_1_27 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L170] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L171] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L171] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_29=11/2, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L172] var_1_29 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L176] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=3877983372, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L177] var_1_34 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_34 >= 3221225471) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L178] RET assume_abort_if_not(var_1_34 >= 3221225471) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L179] CALL assume_abort_if_not(var_1_34 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L179] RET assume_abort_if_not(var_1_34 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=0, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L180] var_1_36 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L181] RET assume_abort_if_not((var_1_36 >= 4611686.018427382800e+12F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_37=499998/5, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L182] var_1_37 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_39=35/4, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L185] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L199] RET updateVariables() [L200] CALL step() [L59] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L60] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=16, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L62] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_38=128/5, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L63] COND FALSE !(var_1_27 < var_1_34) [L70] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=-2, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L72] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L73] var_1_32 = var_1_31 [L74] unsigned short int stepLocal_3 = var_1_12; [L75] unsigned short int stepLocal_2 = var_1_12; [L76] unsigned short int stepLocal_1 = var_1_12; [L77] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L78] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L78] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L79] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L93] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L98] COND TRUE var_1_12 <= ((var_1_34 - var_1_31) - ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) [L99] var_1_33 = 128 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L101] EXPR var_1_19 | var_1_12 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_35=67/4, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L101] COND FALSE !((var_1_19 | var_1_12) > var_1_19) [L108] var_1_35 = (((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) - var_1_37) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L110] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L111] COND TRUE var_1_13 <= var_1_11 [L112] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-2, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L116] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_6=1/2, var_1_9=4] [L117] COND TRUE var_1_19 <= var_1_1 [L118] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L120] EXPR var_1_1 & var_1_11 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=16/5, var_1_27=-1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L120] COND FALSE !(((((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) > (2u)) ? (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))) : (2u))) > (var_1_1 & var_1_11)) [L129] var_1_23 = var_1_29 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L191-L192] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-16357, var_1_1=-64, var_1_20=0, var_1_21=16383, var_1_22=-127, var_1_23=3, var_1_27=-1, var_1_29=3, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=4294967295, var_1_36=2, var_1_38=2, var_1_4=-32768, var_1_5=-64, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.7s, OverallIterations: 14, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2987 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2987 mSDsluCounter, 6406 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 1002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5240 IncrementalHoareTripleChecker+Invalid, 6242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1002 mSolverCounterUnsat, 2612 mSDtfsCounter, 5240 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1010occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1059 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 48.3s InterpolantComputationTime, 3496 NumberOfCodeBlocks, 3496 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3042 ConstructedInterpolants, 0 QuantifiedInterpolants, 16507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 31350/31416 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-02-05 23:30:26,476 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-05 23:30:26,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:30:28,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:30:28,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:30:28,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:30:28,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:30:28,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:30:28,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:30:28,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:30:28,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:30:28,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:30:28,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:30:28,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:30:28,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:30:28,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:30:28,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:30:28,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:30:28,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:30:28,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:30:28,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:30:28,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:30:28,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:30:28,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:30:28,417 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2025-02-05 23:30:28,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:30:28,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:30:28,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:30:28,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:30:28,665 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:30:28,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:30:29,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b3e15681/e959d9a599e24d70a69facf48b10edde/FLAGde707b7a3 [2025-02-05 23:30:30,063 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:30:30,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:30:30,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b3e15681/e959d9a599e24d70a69facf48b10edde/FLAGde707b7a3 [2025-02-05 23:30:30,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b3e15681/e959d9a599e24d70a69facf48b10edde [2025-02-05 23:30:30,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:30:30,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:30:30,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:30:30,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:30:30,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:30:30,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c0d043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30, skipping insertion in model container [2025-02-05 23:30:30,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:30:30,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-02-05 23:30:30,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:30:30,611 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:30:30,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2025-02-05 23:30:30,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:30:30,662 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:30:30,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30 WrapperNode [2025-02-05 23:30:30,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:30:30,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:30:30,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:30:30,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:30:30,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,717 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-02-05 23:30:30,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:30:30,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:30:30,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:30:30,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:30:30,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,762 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-02-05 23:30:30,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:30:30,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:30:30,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:30:30,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:30:30,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (1/1) ... [2025-02-05 23:30:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:30:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:30:30,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:30:30,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:30:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:30:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:30:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:30:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:30:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:30:30,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:30:30,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:30:30,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:30:34,710 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:30:34,711 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:30:34,726 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:30:34,727 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:30:34,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:34 BoogieIcfgContainer [2025-02-05 23:30:34,730 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:30:34,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:30:34,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:30:34,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:30:34,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:30:30" (1/3) ... [2025-02-05 23:30:34,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668a6987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:34, skipping insertion in model container [2025-02-05 23:30:34,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:30" (2/3) ... [2025-02-05 23:30:34,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668a6987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:34, skipping insertion in model container [2025-02-05 23:30:34,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:34" (3/3) ... [2025-02-05 23:30:34,737 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2025-02-05 23:30:34,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:30:34,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:30:34,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:30:34,794 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;@e0109d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:30:34,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:30:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:30:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 23:30:34,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:34,807 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:34,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2051670832, now seen corresponding path program 1 times [2025-02-05 23:30:34,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:30:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631541833] [2025-02-05 23:30:34,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:34,823 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-02-05 23:30:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:30:34,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:30:34,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 23:30:34,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 23:30:35,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 23:30:35,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:35,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:35,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:30:35,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:30:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2025-02-05 23:30:35,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:30:35,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:30:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631541833] [2025-02-05 23:30:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631541833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:30:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:30:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:30:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682047688] [2025-02-05 23:30:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:30:35,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:30:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:30:35,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:30:35,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:30:35,327 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:30:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:30:35,345 INFO L93 Difference]: Finished difference Result 178 states and 317 transitions. [2025-02-05 23:30:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:30:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-02-05 23:30:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:30:35,354 INFO L225 Difference]: With dead ends: 178 [2025-02-05 23:30:35,354 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 23:30:35,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 211 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-02-05 23:30:35,361 INFO L435 NwaCegarLoop]: 138 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, 138 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-02-05 23:30:35,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:30:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 23:30:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 23:30:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:30:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-02-05 23:30:35,408 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 212 [2025-02-05 23:30:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:30:35,409 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-02-05 23:30:35,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:30:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-02-05 23:30:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 23:30:35,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:30:35,412 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:30:35,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 23:30:35,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 23:30:35,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:30:35,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:30:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash -555506704, now seen corresponding path program 1 times [2025-02-05 23:30:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:30:35,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255779044] [2025-02-05 23:30:35,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:30:35,615 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-02-05 23:30:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:30:35,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 23:30:35,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 23:30:35,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 23:30:36,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 23:30:36,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:30:36,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:30:36,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 23:30:36,100 INFO L279 TraceCheckSpWp]: Computing forward predicates...