./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:15:29,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:15:29,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:15:29,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:15:29,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:15:29,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:15:29,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:15:29,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:15:29,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:15:29,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:15:29,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:15:29,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:15:29,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:15:29,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:15:29,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:15:29,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:15:29,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:15:29,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:15:29,490 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2025-02-05 22:15:29,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:15:29,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:15:29,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:15:29,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:15:29,790 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:15:29,791 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-pe-ci_file-1.i [2025-02-05 22:15:31,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8447daa00/93a91b86fa714b02a0bf2cd52b9ea7c3/FLAG48dcf60dc [2025-02-05 22:15:31,380 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:15:31,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2025-02-05 22:15:31,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8447daa00/93a91b86fa714b02a0bf2cd52b9ea7c3/FLAG48dcf60dc [2025-02-05 22:15:31,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8447daa00/93a91b86fa714b02a0bf2cd52b9ea7c3 [2025-02-05 22:15:31,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:15:31,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:15:31,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:15:31,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:15:31,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:15:31,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46165b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31, skipping insertion in model container [2025-02-05 22:15:31,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:15:31,569 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-pe-ci_file-1.i[918,931] [2025-02-05 22:15:31,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:15:31,653 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:15:31,662 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-pe-ci_file-1.i[918,931] [2025-02-05 22:15:31,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:15:31,718 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:15:31,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31 WrapperNode [2025-02-05 22:15:31,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:15:31,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:15:31,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:15:31,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:15:31,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,773 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-02-05 22:15:31,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:15:31,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:15:31,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:15:31,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:15:31,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,813 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 22:15:31,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:15:31,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:15:31,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:15:31,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:15:31,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (1/1) ... [2025-02-05 22:15:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:15:31,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:15:31,875 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 22:15:31,880 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 22:15:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:15:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:15:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:15:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:15:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:15:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:15:31,981 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:15:31,983 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:15:32,354 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 22:15:32,355 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:15:32,370 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:15:32,370 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:15:32,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:32 BoogieIcfgContainer [2025-02-05 22:15:32,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:15:32,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:15:32,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:15:32,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:15:32,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:15:31" (1/3) ... [2025-02-05 22:15:32,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202b3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:32, skipping insertion in model container [2025-02-05 22:15:32,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:31" (2/3) ... [2025-02-05 22:15:32,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202b3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:32, skipping insertion in model container [2025-02-05 22:15:32,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:32" (3/3) ... [2025-02-05 22:15:32,379 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2025-02-05 22:15:32,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:15:32,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:15:32,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:15:32,464 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;@1b8aea28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:15:32,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:15:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 22:15:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:15:32,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:32,482 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:32,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1317098573, now seen corresponding path program 1 times [2025-02-05 22:15:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785571298] [2025-02-05 22:15:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:32,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:32,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:32,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:32,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 22:15:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785571298] [2025-02-05 22:15:32,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785571298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:15:32,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315921645] [2025-02-05 22:15:32,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:32,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:15:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:15:32,806 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 22:15:32,808 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 22:15:32,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:33,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:33,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:33,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:33,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:15:33,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-02-05 22:15:33,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:15:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315921645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:33,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:15:33,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:15:33,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699656343] [2025-02-05 22:15:33,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:33,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:15:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:33,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:15:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:15:33,100 INFO L87 Difference]: Start difference. First operand has 95 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:15:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:33,134 INFO L93 Difference]: Finished difference Result 184 states and 328 transitions. [2025-02-05 22:15:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:15:33,136 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-02-05 22:15:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:33,142 INFO L225 Difference]: With dead ends: 184 [2025-02-05 22:15:33,142 INFO L226 Difference]: Without dead ends: 92 [2025-02-05 22:15:33,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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 22:15:33,148 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:33,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:15:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-05 22:15:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-05 22:15:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 22:15:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2025-02-05 22:15:33,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 199 [2025-02-05 22:15:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2025-02-05 22:15:33,191 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-05 22:15:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2025-02-05 22:15:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:15:33,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:33,198 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:33,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:15:33,398 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 22:15:33,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:33,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1587567667, now seen corresponding path program 1 times [2025-02-05 22:15:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614380415] [2025-02-05 22:15:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:33,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:33,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:33,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614380415] [2025-02-05 22:15:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614380415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:33,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:33,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:15:33,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198947805] [2025-02-05 22:15:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:33,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:15:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:33,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:15:33,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:33,799 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:34,067 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2025-02-05 22:15:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:15:34,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-02-05 22:15:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:34,074 INFO L225 Difference]: With dead ends: 227 [2025-02-05 22:15:34,074 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 22:15:34,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:34,076 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:34,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 360 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:15:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 22:15:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-02-05 22:15:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 22:15:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 212 transitions. [2025-02-05 22:15:34,096 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 212 transitions. Word has length 199 [2025-02-05 22:15:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:34,097 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 212 transitions. [2025-02-05 22:15:34,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 212 transitions. [2025-02-05 22:15:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:15:34,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:34,100 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:15:34,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:34,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1458484948, now seen corresponding path program 1 times [2025-02-05 22:15:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252601660] [2025-02-05 22:15:34,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:34,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:34,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252601660] [2025-02-05 22:15:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252601660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:15:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65018808] [2025-02-05 22:15:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:15:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:34,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:15:34,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:34,463 INFO L87 Difference]: Start difference. First operand 135 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:34,529 INFO L93 Difference]: Finished difference Result 267 states and 421 transitions. [2025-02-05 22:15:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:15:34,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-02-05 22:15:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:34,533 INFO L225 Difference]: With dead ends: 267 [2025-02-05 22:15:34,533 INFO L226 Difference]: Without dead ends: 135 [2025-02-05 22:15:34,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:34,534 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:34,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:15:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-05 22:15:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-05 22:15:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 89 states have internal predecessors, (122), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 22:15:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 210 transitions. [2025-02-05 22:15:34,556 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 210 transitions. Word has length 199 [2025-02-05 22:15:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:34,557 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 210 transitions. [2025-02-05 22:15:34,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 210 transitions. [2025-02-05 22:15:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 22:15:34,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:34,562 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:15:34,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash 74309877, now seen corresponding path program 1 times [2025-02-05 22:15:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176172164] [2025-02-05 22:15:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:34,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 22:15:34,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 22:15:34,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:34,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:34,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176172164] [2025-02-05 22:15:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176172164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:15:34,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099062567] [2025-02-05 22:15:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:34,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:15:34,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:34,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:15:34,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:15:34,927 INFO L87 Difference]: Start difference. First operand 135 states and 210 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:34,979 INFO L93 Difference]: Finished difference Result 399 states and 624 transitions. [2025-02-05 22:15:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:15:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-02-05 22:15:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:34,983 INFO L225 Difference]: With dead ends: 399 [2025-02-05 22:15:34,984 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 22:15:34,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:15:34,988 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:34,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 301 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:15:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 22:15:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-02-05 22:15:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.3895348837209303) internal successors, (239), 174 states have internal predecessors, (239), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 22:15:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 415 transitions. [2025-02-05 22:15:35,027 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 415 transitions. Word has length 200 [2025-02-05 22:15:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:35,028 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 415 transitions. [2025-02-05 22:15:35,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 415 transitions. [2025-02-05 22:15:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:35,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:35,029 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:35,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:15:35,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:35,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1700364203, now seen corresponding path program 1 times [2025-02-05 22:15:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:35,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527609272] [2025-02-05 22:15:35,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:35,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:35,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:35,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:35,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:35,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527609272] [2025-02-05 22:15:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527609272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:15:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066253821] [2025-02-05 22:15:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:15:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:35,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:15:35,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:15:35,215 INFO L87 Difference]: Start difference. First operand 265 states and 415 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:35,600 INFO L93 Difference]: Finished difference Result 765 states and 1204 transitions. [2025-02-05 22:15:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:15:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-02-05 22:15:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:35,604 INFO L225 Difference]: With dead ends: 765 [2025-02-05 22:15:35,604 INFO L226 Difference]: Without dead ends: 633 [2025-02-05 22:15:35,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:15:35,605 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 265 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:35,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 444 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:15:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-05 22:15:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 286. [2025-02-05 22:15:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 22:15:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 448 transitions. [2025-02-05 22:15:35,652 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 448 transitions. Word has length 201 [2025-02-05 22:15:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:35,653 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 448 transitions. [2025-02-05 22:15:35,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 448 transitions. [2025-02-05 22:15:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:35,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:35,655 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:35,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:15:35,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:35,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2032660267, now seen corresponding path program 1 times [2025-02-05 22:15:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:35,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903652593] [2025-02-05 22:15:35,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:35,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:35,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:35,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:35,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903652593] [2025-02-05 22:15:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903652593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:15:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051861391] [2025-02-05 22:15:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:36,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:15:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:36,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:15:36,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:15:36,003 INFO L87 Difference]: Start difference. First operand 286 states and 448 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:36,679 INFO L93 Difference]: Finished difference Result 988 states and 1526 transitions. [2025-02-05 22:15:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:15:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-02-05 22:15:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:36,684 INFO L225 Difference]: With dead ends: 988 [2025-02-05 22:15:36,684 INFO L226 Difference]: Without dead ends: 705 [2025-02-05 22:15:36,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:15:36,686 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 323 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:36,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 507 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:15:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-05 22:15:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 219. [2025-02-05 22:15:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 152 states have (on average 1.4210526315789473) internal successors, (216), 152 states have internal predecessors, (216), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:15:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 340 transitions. [2025-02-05 22:15:36,727 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 340 transitions. Word has length 201 [2025-02-05 22:15:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:36,727 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 340 transitions. [2025-02-05 22:15:36,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 340 transitions. [2025-02-05 22:15:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:36,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:36,729 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:36,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:15:36,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:36,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1489013290, now seen corresponding path program 1 times [2025-02-05 22:15:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:36,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838901108] [2025-02-05 22:15:36,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:36,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:36,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:36,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:36,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838901108] [2025-02-05 22:15:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838901108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:15:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660585436] [2025-02-05 22:15:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:15:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:15:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:36,880 INFO L87 Difference]: Start difference. First operand 219 states and 340 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:37,054 INFO L93 Difference]: Finished difference Result 436 states and 683 transitions. [2025-02-05 22:15:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:15:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-02-05 22:15:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:37,057 INFO L225 Difference]: With dead ends: 436 [2025-02-05 22:15:37,057 INFO L226 Difference]: Without dead ends: 325 [2025-02-05 22:15:37,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:15:37,058 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 107 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 403 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:15:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-05 22:15:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 224. [2025-02-05 22:15:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:15:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2025-02-05 22:15:37,092 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 201 [2025-02-05 22:15:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:37,092 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2025-02-05 22:15:37,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2025-02-05 22:15:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:37,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:37,095 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:37,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:15:37,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1821309354, now seen corresponding path program 1 times [2025-02-05 22:15:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:37,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110203593] [2025-02-05 22:15:37,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:37,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:37,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:37,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110203593] [2025-02-05 22:15:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110203593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:15:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179397292] [2025-02-05 22:15:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:15:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:15:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:15:37,372 INFO L87 Difference]: Start difference. First operand 224 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:37,960 INFO L93 Difference]: Finished difference Result 739 states and 1138 transitions. [2025-02-05 22:15:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:15:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-02-05 22:15:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:37,964 INFO L225 Difference]: With dead ends: 739 [2025-02-05 22:15:37,964 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 22:15:37,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:15:37,965 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 348 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:37,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 641 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:15:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 22:15:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 242. [2025-02-05 22:15:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 1.4285714285714286) internal successors, (250), 175 states have internal predecessors, (250), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:15:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 374 transitions. [2025-02-05 22:15:38,013 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 374 transitions. Word has length 201 [2025-02-05 22:15:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:38,015 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 374 transitions. [2025-02-05 22:15:38,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 374 transitions. [2025-02-05 22:15:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:38,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:38,019 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:15:38,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:38,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1553707160, now seen corresponding path program 1 times [2025-02-05 22:15:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062307802] [2025-02-05 22:15:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:38,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:38,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:38,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-02-05 22:15:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:15:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062307802] [2025-02-05 22:15:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062307802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:15:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410884010] [2025-02-05 22:15:38,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:38,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:15:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:15:38,458 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 22:15:38,460 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 22:15:38,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:38,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:38,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 22:15:38,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 688 proven. 69 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2025-02-05 22:15:39,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:15:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-02-05 22:15:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410884010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:15:39,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:15:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2025-02-05 22:15:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551191623] [2025-02-05 22:15:39,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:15:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:15:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:15:39,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:15:39,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:15:39,739 INFO L87 Difference]: Start difference. First operand 242 states and 374 transitions. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-02-05 22:15:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:41,205 INFO L93 Difference]: Finished difference Result 864 states and 1297 transitions. [2025-02-05 22:15:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 22:15:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 201 [2025-02-05 22:15:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:41,209 INFO L225 Difference]: With dead ends: 864 [2025-02-05 22:15:41,209 INFO L226 Difference]: Without dead ends: 625 [2025-02-05 22:15:41,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 22:15:41,211 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 801 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:41,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1081 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 22:15:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-05 22:15:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 432. [2025-02-05 22:15:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 314 states have (on average 1.4012738853503184) internal successors, (440), 316 states have internal predecessors, (440), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-05 22:15:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2025-02-05 22:15:41,264 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 201 [2025-02-05 22:15:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:41,265 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2025-02-05 22:15:41,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2025-02-05 22:15:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2025-02-05 22:15:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 22:15:41,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:41,267 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:41,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:15:41,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:15:41,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1357193655, now seen corresponding path program 1 times [2025-02-05 22:15:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:15:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832761367] [2025-02-05 22:15:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:15:41,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:41,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:41,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:41,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:15:41,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457283922] [2025-02-05 22:15:41,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:41,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:15:41,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:15:41,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:15:41,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:15:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:41,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:41,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:15:41,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:15:41,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 22:15:41,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 22:15:41,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:41,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:15:41,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:15:41,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:15:41,827 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:15:41,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 22:15:42,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:15:42,034 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:15:42,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:15:42,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:15:42 BoogieIcfgContainer [2025-02-05 22:15:42,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:15:42,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:15:42,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:15:42,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:15:42,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:32" (3/4) ... [2025-02-05 22:15:42,138 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:15:42,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:15:42,139 INFO L158 Benchmark]: Toolchain (without parser) took 10722.69ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.2MB in the beginning and 136.9MB in the end (delta: -14.7MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2025-02-05 22:15:42,139 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:15:42,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 106.6MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:15:42,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 102.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:15:42,140 INFO L158 Benchmark]: Boogie Preprocessor took 61.31ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:15:42,140 INFO L158 Benchmark]: IcfgBuilder took 531.55ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 71.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:15:42,140 INFO L158 Benchmark]: TraceAbstraction took 9762.70ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 70.3MB in the beginning and 137.0MB in the end (delta: -66.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-02-05 22:15:42,140 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 243.3MB. Free memory was 137.0MB in the beginning and 136.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:15:42,141 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 106.6MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 102.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.31ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 98.7MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 531.55ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 71.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9762.70ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 70.3MB in the beginning and 137.0MB in the end (delta: -66.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 243.3MB. Free memory was 137.0MB in the beginning and 136.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_46 = 0; [L53] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] FCALL updateLastVariables() [L196] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L137] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L138] var_1_11 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L139] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L140] var_1_13 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L143] var_1_14 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L144] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L145] var_1_16 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L151] var_1_19 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L157] var_1_21 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L160] var_1_22 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L169] var_1_26 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L170] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L172] var_1_35 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L173] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L175] var_1_39 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L176] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L178] var_1_40 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L179] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L181] var_1_41 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L182] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L196] RET updateVariables() [L197] CALL step() [L57] var_1_15 = (var_1_16 - var_1_17) [L58] var_1_27 = var_1_21 [L59] unsigned char stepLocal_1 = var_1_27; [L60] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L61] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L62] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L70] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L73] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 > stepLocal_2) [L77] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L79] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L80] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L82] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L92] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L93] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L94] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L97] COND TRUE 1 >= stepLocal_3 [L98] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] EXPR var_1_27 | (var_1_21 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] COND FALSE !(var_1_27 < (var_1_27 | (var_1_21 + var_1_27))) [L106] EXPR var_1_21 >> var_1_21 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L106] COND TRUE var_1_21 >= (var_1_21 >> var_1_21) [L107] COND FALSE !(var_1_23 || (var_1_17 < var_1_21)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L111] COND FALSE !(var_1_27 > (var_1_20 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L114] COND TRUE 63.75f <= var_1_11 [L115] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L117] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27)))) [L120] var_1_42 = (var_1_25 || var_1_25) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L122] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L129] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=125, var_1_19=-1, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-62, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=6442450943, var_1_39=5368709119, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 10, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2050 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1992 mSDsluCounter, 4259 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2799 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2508 IncrementalHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 1460 mSDtfsCounter, 2508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 685 GetRequests, 617 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1408 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2391 ConstructedInterpolants, 0 QuantifiedInterpolants, 5877 SizeOfPredicates, 6 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 22053/22320 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 22:15:42,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:15:44,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:15:44,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:15:44,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:15:44,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:15:44,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:15:44,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:15:44,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:15:44,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:15:44,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:15:44,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:15:44,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:15:44,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:15:44,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:15:44,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:15:44,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:15:44,218 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2025-02-05 22:15:44,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:15:44,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:15:44,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:15:44,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:15:44,491 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:15:44,493 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-pe-ci_file-1.i [2025-02-05 22:15:45,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d514b34d1/36d662669561432aba6f61d25fc2eaf6/FLAG99b37de28 [2025-02-05 22:15:46,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:15:46,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2025-02-05 22:15:46,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d514b34d1/36d662669561432aba6f61d25fc2eaf6/FLAG99b37de28 [2025-02-05 22:15:46,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d514b34d1/36d662669561432aba6f61d25fc2eaf6 [2025-02-05 22:15:46,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:15:46,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:15:46,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:15:46,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:15:46,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:15:46,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9be6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46, skipping insertion in model container [2025-02-05 22:15:46,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:15:46,272 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-pe-ci_file-1.i[918,931] [2025-02-05 22:15:46,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:15:46,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:15:46,394 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-pe-ci_file-1.i[918,931] [2025-02-05 22:15:46,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:15:46,469 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:15:46,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46 WrapperNode [2025-02-05 22:15:46,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:15:46,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:15:46,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:15:46,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:15:46,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,529 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-02-05 22:15:46,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:15:46,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:15:46,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:15:46,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:15:46,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,568 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 22:15:46,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:15:46,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:15:46,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:15:46,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:15:46,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (1/1) ... [2025-02-05 22:15:46,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:15:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:15:46,626 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 22:15:46,634 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 22:15:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:15:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:15:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:15:46,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:15:46,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:15:46,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:15:46,742 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:15:46,744 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:15:47,202 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 22:15:47,204 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:15:47,215 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:15:47,216 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:15:47,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:47 BoogieIcfgContainer [2025-02-05 22:15:47,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:15:47,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:15:47,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:15:47,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:15:47,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:15:46" (1/3) ... [2025-02-05 22:15:47,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e06f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:47, skipping insertion in model container [2025-02-05 22:15:47,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:15:46" (2/3) ... [2025-02-05 22:15:47,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e06f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:15:47, skipping insertion in model container [2025-02-05 22:15:47,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:15:47" (3/3) ... [2025-02-05 22:15:47,223 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2025-02-05 22:15:47,234 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:15:47,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:15:47,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:15:47,303 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;@60af9e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:15:47,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:15:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 22:15:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 22:15:47,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:47,321 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:47,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1396238474, now seen corresponding path program 1 times [2025-02-05 22:15:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435863694] [2025-02-05 22:15:47,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:47,334 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 22:15:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:47,336 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 22:15:47,338 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 22:15:47,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:15:47,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:15:47,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:47,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:47,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:15:47,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:47,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:15:47,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:47,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435863694] [2025-02-05 22:15:47,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435863694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:47,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:47,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:15:47,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902312959] [2025-02-05 22:15:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:15:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:47,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:15:47,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:15:47,749 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:47,766 INFO L93 Difference]: Finished difference Result 174 states and 312 transitions. [2025-02-05 22:15:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:15:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-02-05 22:15:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:47,780 INFO L225 Difference]: With dead ends: 174 [2025-02-05 22:15:47,780 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 22:15:47,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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 22:15:47,790 INFO L435 NwaCegarLoop]: 137 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, 137 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 22:15:47,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:15:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 22:15:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 22:15:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 22:15:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2025-02-05 22:15:47,842 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 197 [2025-02-05 22:15:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:47,847 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2025-02-05 22:15:47,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2025-02-05 22:15:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 22:15:47,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:47,853 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:47,863 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 22:15:48,054 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 22:15:48,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:48,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash 551766603, now seen corresponding path program 1 times [2025-02-05 22:15:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653682903] [2025-02-05 22:15:48,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:48,056 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 22:15:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:48,058 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 22:15:48,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:15:48,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:15:48,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:15:48,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:48,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:15:48,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 22:15:48,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:15:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:48,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653682903] [2025-02-05 22:15:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653682903] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:15:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:15:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-02-05 22:15:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883577823] [2025-02-05 22:15:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:48,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:15:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:48,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:15:48,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:15:48,987 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:49,080 INFO L93 Difference]: Finished difference Result 171 states and 271 transitions. [2025-02-05 22:15:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:15:49,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-02-05 22:15:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:49,087 INFO L225 Difference]: With dead ends: 171 [2025-02-05 22:15:49,087 INFO L226 Difference]: Without dead ends: 87 [2025-02-05 22:15:49,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:15:49,091 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:49,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:15:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-05 22:15:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-05 22:15:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-05 22:15:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2025-02-05 22:15:49,107 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2025-02-05 22:15:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:49,108 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2025-02-05 22:15:49,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2025-02-05 22:15:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 22:15:49,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:49,113 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:49,128 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-05 22:15:49,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:15:49,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:49,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1905076300, now seen corresponding path program 1 times [2025-02-05 22:15:49,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:49,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201942364] [2025-02-05 22:15:49,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:49,316 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 22:15:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:49,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:15:49,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:15:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:15:49,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:15:49,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:49,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:15:49,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:49,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:15:49,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:49,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201942364] [2025-02-05 22:15:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201942364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:49,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:15:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:15:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239527469] [2025-02-05 22:15:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:49,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:15:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:49,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:15:49,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:15:49,844 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:49,890 INFO L93 Difference]: Finished difference Result 255 states and 402 transitions. [2025-02-05 22:15:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:15:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-02-05 22:15:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:49,894 INFO L225 Difference]: With dead ends: 255 [2025-02-05 22:15:49,894 INFO L226 Difference]: Without dead ends: 171 [2025-02-05 22:15:49,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 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 22:15:49,895 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 37 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:49,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:15:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-05 22:15:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-02-05 22:15:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:15:49,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2025-02-05 22:15:49,937 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 197 [2025-02-05 22:15:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:49,937 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2025-02-05 22:15:49,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2025-02-05 22:15:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 22:15:49,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:49,942 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:49,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:15:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:15:50,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1551539500, now seen corresponding path program 1 times [2025-02-05 22:15:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711485042] [2025-02-05 22:15:50,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:50,144 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 22:15:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:50,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:15:50,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:15:50,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:15:50,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:15:50,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:50,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:50,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:15:50,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 940 proven. 51 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-02-05 22:15:50,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:15:50,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711485042] [2025-02-05 22:15:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711485042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:15:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2119625403] [2025-02-05 22:15:50,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:50,583 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:15:50,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:15:50,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:15:50,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-05 22:15:50,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:15:51,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:15:51,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:51,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:51,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:15:51,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:51,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:15:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2119625403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:15:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:15:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-02-05 22:15:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014618822] [2025-02-05 22:15:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:51,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:15:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:51,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:15:51,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:15:51,367 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:52,137 INFO L93 Difference]: Finished difference Result 502 states and 790 transitions. [2025-02-05 22:15:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:15:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-02-05 22:15:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:52,141 INFO L225 Difference]: With dead ends: 502 [2025-02-05 22:15:52,143 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 22:15:52,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:15:52,145 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 271 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:52,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 377 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:15:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 22:15:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 225. [2025-02-05 22:15:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 146 states have internal predecessors, (195), 75 states have call successors, (75), 4 states have call predecessors, (75), 4 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-05 22:15:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 345 transitions. [2025-02-05 22:15:52,173 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 345 transitions. Word has length 198 [2025-02-05 22:15:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:52,173 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 345 transitions. [2025-02-05 22:15:52,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 345 transitions. [2025-02-05 22:15:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:15:52,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:52,175 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:52,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-05 22:15:52,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 22:15:52,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:15:52,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:52,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -321344307, now seen corresponding path program 1 times [2025-02-05 22:15:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003766248] [2025-02-05 22:15:52,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:52,577 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 22:15:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:52,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:15:52,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 22:15:52,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:52,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:52,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:52,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:52,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 22:15:52,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 22:15:53,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:15:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-02-05 22:15:53,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:53,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003766248] [2025-02-05 22:15:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003766248] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 22:15:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:15:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-02-05 22:15:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201429043] [2025-02-05 22:15:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:15:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:15:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:53,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:15:53,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:15:53,653 INFO L87 Difference]: Start difference. First operand 225 states and 345 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:15:54,306 INFO L93 Difference]: Finished difference Result 650 states and 999 transitions. [2025-02-05 22:15:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:15:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-02-05 22:15:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:15:54,315 INFO L225 Difference]: With dead ends: 650 [2025-02-05 22:15:54,316 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 22:15:54,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:15:54,317 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 282 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:15:54,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 317 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:15:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 22:15:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 229. [2025-02-05 22:15:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.3641975308641976) internal successors, (221), 162 states have internal predecessors, (221), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 22:15:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2025-02-05 22:15:54,344 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 199 [2025-02-05 22:15:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:15:54,345 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2025-02-05 22:15:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-02-05 22:15:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2025-02-05 22:15:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:15:54,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:15:54,346 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:15:54,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-02-05 22:15:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 22:15:54,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:15:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:15:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash -192261588, now seen corresponding path program 1 times [2025-02-05 22:15:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:15:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726596790] [2025-02-05 22:15:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:15:54,548 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 22:15:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:15:54,551 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:15:54,552 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 (8)] Waiting until timeout for monitored process [2025-02-05 22:15:54,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:15:54,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:15:54,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:15:54,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:15:54,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 22:15:54,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:15:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1085 proven. 159 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-02-05 22:15:55,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:15:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-02-05 22:15:56,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:15:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726596790] [2025-02-05 22:15:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726596790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:15:56,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:15:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2025-02-05 22:15:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209346244] [2025-02-05 22:15:56,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:15:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 22:15:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:15:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 22:15:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:15:56,679 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2025-02-05 22:16:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:16:02,097 INFO L93 Difference]: Finished difference Result 1362 states and 1986 transitions. [2025-02-05 22:16:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-05 22:16:02,098 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 199 [2025-02-05 22:16:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:16:02,105 INFO L225 Difference]: With dead ends: 1362 [2025-02-05 22:16:02,105 INFO L226 Difference]: Without dead ends: 1136 [2025-02-05 22:16:02,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1677, Invalid=3293, Unknown=0, NotChecked=0, Total=4970 [2025-02-05 22:16:02,108 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1092 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:16:02,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1020 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 22:16:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-02-05 22:16:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 297. [2025-02-05 22:16:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 218 states have (on average 1.353211009174312) internal successors, (295), 219 states have internal predecessors, (295), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 22:16:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 433 transitions. [2025-02-05 22:16:02,148 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 433 transitions. Word has length 199 [2025-02-05 22:16:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:16:02,149 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 433 transitions. [2025-02-05 22:16:02,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2025-02-05 22:16:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 433 transitions. [2025-02-05 22:16:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:16:02,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:16:02,151 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:16:02,160 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 (8)] Ended with exit code 0 [2025-02-05 22:16:02,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 22:16:02,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:16:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:16:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1308725875, now seen corresponding path program 1 times [2025-02-05 22:16:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:16:02,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543156983] [2025-02-05 22:16:02,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:16:02,353 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 22:16:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:16:02,355 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:16:02,356 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 (9)] Waiting until timeout for monitored process [2025-02-05 22:16:02,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:16:02,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:16:02,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:16:02,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:16:02,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 22:16:02,573 INFO L279 TraceCheckSpWp]: Computing forward predicates...