./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-51.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_loopvsstraightlinecode_50-1loop_file-51.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 fec5d0d42f7d3740618b246d7c7286f4374e434ebe6ff4f79d1a456d07b8f1f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:36:53,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:36:53,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:36:53,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:36:53,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:36:53,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:36:53,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:36:53,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:36:53,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:36:53,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:36:53,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:36:53,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:36:53,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:36:53,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:36:53,746 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:36:53,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:36:53,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:36:53,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:36:53,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:36:53,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:36:53,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:36:53,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:36:53,749 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 -> fec5d0d42f7d3740618b246d7c7286f4374e434ebe6ff4f79d1a456d07b8f1f3 [2025-02-06 01:36:53,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:36:53,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:36:53,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:36:53,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:36:53,995 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:36:53,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:36:55,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee9fa8d7/45808ae1e88e4ce7b9601898404f8c08/FLAG1e8af9dfa [2025-02-06 01:36:55,405 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:36:55,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:36:55,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee9fa8d7/45808ae1e88e4ce7b9601898404f8c08/FLAG1e8af9dfa [2025-02-06 01:36:55,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee9fa8d7/45808ae1e88e4ce7b9601898404f8c08 [2025-02-06 01:36:55,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:36:55,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:36:55,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:36:55,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:36:55,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:36:55,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:55,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd9d3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55, skipping insertion in model container [2025-02-06 01:36:55,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:55,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:36:55,862 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_loopvsstraightlinecode_50-1loop_file-51.i[915,928] [2025-02-06 01:36:55,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:36:55,921 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:36:55,928 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_loopvsstraightlinecode_50-1loop_file-51.i[915,928] [2025-02-06 01:36:55,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:36:55,968 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:36:55,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55 WrapperNode [2025-02-06 01:36:55,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:36:55,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:36:55,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:36:55,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:36:55,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:55,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:55,993 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-02-06 01:36:55,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:36:55,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:36:55,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:36:55,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:36:56,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,022 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-06 01:36:56,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:36:56,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:36:56,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:36:56,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:36:56,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (1/1) ... [2025-02-06 01:36:56,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:36:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:36:56,068 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-06 01:36:56,075 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-06 01:36:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:36:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:36:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:36:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:36:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:36:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:36:56,158 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:36:56,159 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:36:56,452 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-06 01:36:56,452 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:36:56,461 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:36:56,461 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:36:56,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:56 BoogieIcfgContainer [2025-02-06 01:36:56,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:36:56,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:36:56,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:36:56,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:36:56,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:36:55" (1/3) ... [2025-02-06 01:36:56,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f090f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:36:56, skipping insertion in model container [2025-02-06 01:36:56,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:36:55" (2/3) ... [2025-02-06 01:36:56,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f090f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:36:56, skipping insertion in model container [2025-02-06 01:36:56,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:56" (3/3) ... [2025-02-06 01:36:56,468 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:36:56,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:36:56,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-51.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:36:56,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:36:56,521 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;@6aa6e7e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:36:56,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:36:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 01:36:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 01:36:56,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:56,530 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:56,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1924390662, now seen corresponding path program 1 times [2025-02-06 01:36:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351592986] [2025-02-06 01:36:56,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:56,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:36:56,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:36:56,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:56,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 01:36:56,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351592986] [2025-02-06 01:36:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351592986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:36:56,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750382838] [2025-02-06 01:36:56,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:56,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:36:56,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:36:56,781 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-06 01:36:56,782 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-06 01:36:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:36:56,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:36:56,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:56,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:36:56,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:36:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-06 01:36:56,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:36:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750382838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:36:56,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:36:56,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:36:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182537963] [2025-02-06 01:36:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:36:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:36:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:56,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:36:56,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:36:56,997 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:36:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:57,015 INFO L93 Difference]: Finished difference Result 129 states and 218 transitions. [2025-02-06 01:36:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:36:57,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-02-06 01:36:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:57,023 INFO L225 Difference]: With dead ends: 129 [2025-02-06 01:36:57,023 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 01:36:57,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-06 01:36:57,027 INFO L435 NwaCegarLoop]: 98 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, 98 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-06 01:36:57,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:36:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 01:36:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 01:36:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 01:36:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-02-06 01:36:57,053 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2025-02-06 01:36:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-02-06 01:36:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:36:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-02-06 01:36:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 01:36:57,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:57,055 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:57,062 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-06 01:36:57,256 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-06 01:36:57,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash 373430967, now seen corresponding path program 1 times [2025-02-06 01:36:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191501097] [2025-02-06 01:36:57,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:57,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:36:57,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:36:57,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:36:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191501097] [2025-02-06 01:36:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191501097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:36:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:36:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:36:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639353889] [2025-02-06 01:36:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:36:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:36:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:57,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:36:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:36:57,641 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:57,761 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2025-02-06 01:36:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:36:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-02-06 01:36:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:57,763 INFO L225 Difference]: With dead ends: 184 [2025-02-06 01:36:57,763 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 01:36:57,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:36:57,764 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:36:57,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 261 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:36:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 01:36:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2025-02-06 01:36:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 01:36:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2025-02-06 01:36:57,781 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2025-02-06 01:36:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2025-02-06 01:36:57,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2025-02-06 01:36:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 01:36:57,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:57,783 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:57,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:36:57,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:57,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1797047601, now seen corresponding path program 1 times [2025-02-06 01:36:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037642215] [2025-02-06 01:36:57,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 01:36:57,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 01:36:57,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:57,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:36:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037642215] [2025-02-06 01:36:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037642215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:36:58,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:36:58,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:36:58,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242278050] [2025-02-06 01:36:58,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:36:58,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:36:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:58,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:36:58,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:36:58,109 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:58,294 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2025-02-06 01:36:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:36:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-02-06 01:36:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:58,296 INFO L225 Difference]: With dead ends: 230 [2025-02-06 01:36:58,296 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 01:36:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:36:58,297 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:36:58,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:36:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 01:36:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2025-02-06 01:36:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 01:36:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2025-02-06 01:36:58,332 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2025-02-06 01:36:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:58,332 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2025-02-06 01:36:58,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2025-02-06 01:36:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 01:36:58,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:58,335 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:58,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:36:58,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:58,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1151353271, now seen corresponding path program 1 times [2025-02-06 01:36:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125101634] [2025-02-06 01:36:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:58,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:36:58,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:36:58,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:58,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:36:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125101634] [2025-02-06 01:36:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125101634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:36:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:36:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:36:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829246954] [2025-02-06 01:36:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:36:58,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:36:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:58,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:36:58,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:36:58,565 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:36:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:58,723 INFO L93 Difference]: Finished difference Result 397 states and 609 transitions. [2025-02-06 01:36:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:36:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2025-02-06 01:36:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:58,726 INFO L225 Difference]: With dead ends: 397 [2025-02-06 01:36:58,726 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 01:36:58,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:36:58,728 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:36:58,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:36:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 01:36:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-02-06 01:36:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 01:36:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2025-02-06 01:36:58,777 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 137 [2025-02-06 01:36:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:58,778 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2025-02-06 01:36:58,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:36:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2025-02-06 01:36:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 01:36:58,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:58,779 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:58,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:36:58,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash 954839766, now seen corresponding path program 1 times [2025-02-06 01:36:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:58,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569850745] [2025-02-06 01:36:58,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:58,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:58,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:36:58,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:36:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:36:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569850745] [2025-02-06 01:36:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569850745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:36:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:36:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:36:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459600505] [2025-02-06 01:36:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:36:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:36:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:58,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:36:58,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:36:58,927 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:58,978 INFO L93 Difference]: Finished difference Result 521 states and 802 transitions. [2025-02-06 01:36:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:36:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2025-02-06 01:36:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:58,980 INFO L225 Difference]: With dead ends: 521 [2025-02-06 01:36:58,981 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 01:36:58,983 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-06 01:36:58,984 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:36:58,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:36:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 01:36:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2025-02-06 01:36:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 01:36:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2025-02-06 01:36:59,039 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 137 [2025-02-06 01:36:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2025-02-06 01:36:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:36:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2025-02-06 01:36:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 01:36:59,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:59,041 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:36:59,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:36:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:36:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -847580432, now seen corresponding path program 1 times [2025-02-06 01:36:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:36:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702697429] [2025-02-06 01:36:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:36:59,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 01:36:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 01:36:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 01:36:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:36:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702697429] [2025-02-06 01:36:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702697429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:36:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128788384] [2025-02-06 01:36:59,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:36:59,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:36:59,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:36:59,257 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-06 01:36:59,258 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-06 01:36:59,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 01:36:59,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 01:36:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:36:59,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:36:59,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:36:59,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:36:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-06 01:36:59,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:36:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 01:36:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128788384] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:36:59,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:36:59,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 01:36:59,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024495492] [2025-02-06 01:36:59,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:36:59,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:36:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:36:59,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:36:59,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:36:59,676 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-02-06 01:36:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:36:59,824 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2025-02-06 01:36:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:36:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 138 [2025-02-06 01:36:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:36:59,828 INFO L225 Difference]: With dead ends: 425 [2025-02-06 01:36:59,828 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 01:36:59,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:36:59,829 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 42 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:36:59,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:36:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 01:36:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 173. [2025-02-06 01:36:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 01:36:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2025-02-06 01:36:59,861 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2025-02-06 01:36:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:36:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2025-02-06 01:36:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-02-06 01:36:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2025-02-06 01:36:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 01:36:59,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:36:59,863 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:36:59,869 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-06 01:37:00,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:37:00,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:37:00,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:37:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1044093937, now seen corresponding path program 1 times [2025-02-06 01:37:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:37:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204371820] [2025-02-06 01:37:00,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:37:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 01:37:00,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 01:37:00,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:00,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:37:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 01:37:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:37:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204371820] [2025-02-06 01:37:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204371820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:37:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382751183] [2025-02-06 01:37:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:00,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:37:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:37:00,292 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-06 01:37:00,293 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-06 01:37:00,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 01:37:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 01:37:00,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:00,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:37:00,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 01:37:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:37:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-02-06 01:37:00,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:37:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-06 01:37:00,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382751183] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:37:00,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:37:00,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-06 01:37:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274813971] [2025-02-06 01:37:00,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:37:00,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:37:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:37:00,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:37:00,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:37:00,904 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 01:37:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:37:01,729 INFO L93 Difference]: Finished difference Result 435 states and 605 transitions. [2025-02-06 01:37:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 01:37:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2025-02-06 01:37:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:37:01,732 INFO L225 Difference]: With dead ends: 435 [2025-02-06 01:37:01,732 INFO L226 Difference]: Without dead ends: 371 [2025-02-06 01:37:01,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-02-06 01:37:01,733 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 140 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:37:01,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 574 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 01:37:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-06 01:37:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2025-02-06 01:37:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.14375) internal successors, (183), 162 states have internal predecessors, (183), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-06 01:37:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2025-02-06 01:37:01,785 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 138 [2025-02-06 01:37:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:37:01,786 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2025-02-06 01:37:01,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 01:37:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2025-02-06 01:37:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:37:01,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:37:01,789 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:37:01,797 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-06 01:37:01,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:37:01,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:37:01,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:37:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2081545878, now seen corresponding path program 1 times [2025-02-06 01:37:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:37:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106811773] [2025-02-06 01:37:01,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:01,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:37:02,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:37:02,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:37:02,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:37:02,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:37:02,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:37:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:37:02,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:37:02,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:37:02,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:37:02,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:37:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 01:37:02,153 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:37:02,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:37:02,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:37:02 BoogieIcfgContainer [2025-02-06 01:37:02,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:37:02,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:37:02,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:37:02,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:37:02,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:36:56" (3/4) ... [2025-02-06 01:37:02,253 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:37:02,254 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:37:02,254 INFO L158 Benchmark]: Toolchain (without parser) took 6541.02ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.7MB in the beginning and 117.0MB in the end (delta: -11.3MB). Peak memory consumption was 145.7MB. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.32ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.45ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: Boogie Preprocessor took 46.86ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: IcfgBuilder took 420.37ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.8MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: TraceAbstraction took 5787.43ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 66.7MB in the beginning and 117.1MB in the end (delta: -50.3MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. [2025-02-06 01:37:02,255 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 302.0MB. Free memory was 117.1MB in the beginning and 117.0MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:37:02,260 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.32ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 91.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.45ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.86ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 420.37ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 67.8MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5787.43ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 66.7MB in the beginning and 117.1MB in the end (delta: -50.3MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 302.0MB. Free memory was 117.1MB in the beginning and 117.0MB in the end (delta: 92.3kB). 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 someUnaryDOUBLEoperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L145] isInitial = 1 [L146] FCALL initially() [L147] int k_loop; [L148] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L148] COND TRUE k_loop < 1 [L149] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L149] RET updateLastVariables() [L150] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L150] RET updateVariables() [L151] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=-1] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L151] RET step() [L152] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L152] RET, EXPR property() [L152] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=-1, var_1_11=3, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-4, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 657 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 743 GetRequests, 697 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 276 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1506 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1631 ConstructedInterpolants, 0 QuantifiedInterpolants, 3282 SizeOfPredicates, 6 NumberOfNonLiveVariables, 979 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 9914/10080 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-06 01:37:02,288 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_loopvsstraightlinecode_50-1loop_file-51.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 fec5d0d42f7d3740618b246d7c7286f4374e434ebe6ff4f79d1a456d07b8f1f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:37:04,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:37:04,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:37:04,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:37:04,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:37:04,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:37:04,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:37:04,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:37:04,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:37:04,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:37:04,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:37:04,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:37:04,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:37:04,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:37:04,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:37:04,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:37:04,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:37:04,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:37:04,486 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 -> fec5d0d42f7d3740618b246d7c7286f4374e434ebe6ff4f79d1a456d07b8f1f3 [2025-02-06 01:37:04,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:37:04,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:37:04,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:37:04,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:37:04,747 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:37:04,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:37:05,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f4f5af/80177c36fe8f471ea81d6f0e7aa863b3/FLAG01a12586f [2025-02-06 01:37:06,101 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:37:06,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:37:06,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f4f5af/80177c36fe8f471ea81d6f0e7aa863b3/FLAG01a12586f [2025-02-06 01:37:06,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6f4f5af/80177c36fe8f471ea81d6f0e7aa863b3 [2025-02-06 01:37:06,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:37:06,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:37:06,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:37:06,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:37:06,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:37:06,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150a55de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06, skipping insertion in model container [2025-02-06 01:37:06,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:37:06,636 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_loopvsstraightlinecode_50-1loop_file-51.i[915,928] [2025-02-06 01:37:06,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:37:06,688 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:37:06,697 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_loopvsstraightlinecode_50-1loop_file-51.i[915,928] [2025-02-06 01:37:06,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:37:06,754 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:37:06,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06 WrapperNode [2025-02-06 01:37:06,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:37:06,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:37:06,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:37:06,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:37:06,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,797 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-02-06 01:37:06,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:37:06,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:37:06,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:37:06,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:37:06,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,825 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-06 01:37:06,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:37:06,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:37:06,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:37:06,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:37:06,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (1/1) ... [2025-02-06 01:37:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:37:06,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:37:06,886 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-06 01:37:06,891 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-06 01:37:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:37:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:37:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:37:06,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:37:06,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:37:06,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:37:06,972 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:37:06,974 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:37:20,467 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-06 01:37:20,471 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:37:20,477 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:37:20,478 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:37:20,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:20 BoogieIcfgContainer [2025-02-06 01:37:20,478 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:37:20,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:37:20,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:37:20,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:37:20,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:37:06" (1/3) ... [2025-02-06 01:37:20,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fe83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:20, skipping insertion in model container [2025-02-06 01:37:20,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:06" (2/3) ... [2025-02-06 01:37:20,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fe83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:20, skipping insertion in model container [2025-02-06 01:37:20,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:20" (3/3) ... [2025-02-06 01:37:20,486 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-51.i [2025-02-06 01:37:20,497 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:37:20,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-51.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:37:20,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:37:20,555 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;@3811af87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:37:20,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:37:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 01:37:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 01:37:20,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:37:20,572 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:37:20,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:37:20,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:37:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1924390662, now seen corresponding path program 1 times [2025-02-06 01:37:20,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:37:20,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426385098] [2025-02-06 01:37:20,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:20,589 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-06 01:37:20,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:37:20,599 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-06 01:37:20,611 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-06 01:37:20,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:37:21,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:37:21,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:37:21,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:37:21,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:37:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-02-06 01:37:21,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:37:21,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:37:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426385098] [2025-02-06 01:37:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426385098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:37:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:37:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:37:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854993940] [2025-02-06 01:37:21,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:37:21,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:37:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:37:21,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:37:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:37:21,506 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:37:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:37:21,522 INFO L93 Difference]: Finished difference Result 129 states and 218 transitions. [2025-02-06 01:37:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:37:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2025-02-06 01:37:21,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:37:21,527 INFO L225 Difference]: With dead ends: 129 [2025-02-06 01:37:21,528 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 01:37:21,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-06 01:37:21,531 INFO L435 NwaCegarLoop]: 98 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, 98 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-06 01:37:21,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:37:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 01:37:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 01:37:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 01:37:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2025-02-06 01:37:21,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2025-02-06 01:37:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:37:21,587 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2025-02-06 01:37:21,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 01:37:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2025-02-06 01:37:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 01:37:21,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:37:21,595 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:37:21,638 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-06 01:37:21,796 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-06 01:37:21,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:37:21,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:37:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 373430967, now seen corresponding path program 1 times [2025-02-06 01:37:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:37:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228299777] [2025-02-06 01:37:21,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:21,798 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-06 01:37:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:37:21,800 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-06 01:37:21,802 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-06 01:37:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 01:37:22,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 01:37:22,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:22,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:37:22,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 01:37:22,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:37:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:37:25,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:37:25,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:37:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228299777] [2025-02-06 01:37:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228299777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:37:25,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:37:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:37:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366329725] [2025-02-06 01:37:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:37:25,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:37:25,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:37:25,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:37:25,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:37:25,184 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:37:29,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:33,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:37,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:42,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:46,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:50,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:37:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:37:50,773 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2025-02-06 01:37:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:37:50,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2025-02-06 01:37:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:37:50,869 INFO L225 Difference]: With dead ends: 184 [2025-02-06 01:37:50,869 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 01:37:50,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:37:50,870 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2025-02-06 01:37:50,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2025-02-06 01:37:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 01:37:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2025-02-06 01:37:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 01:37:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2025-02-06 01:37:50,898 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2025-02-06 01:37:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:37:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2025-02-06 01:37:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:37:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2025-02-06 01:37:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 01:37:50,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:37:50,902 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:37:50,922 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-06 01:37:51,103 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-06 01:37:51,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:37:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:37:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1797047601, now seen corresponding path program 1 times [2025-02-06 01:37:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:37:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275991358] [2025-02-06 01:37:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:37:51,106 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-06 01:37:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:37:51,108 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-06 01:37:51,110 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-06 01:37:51,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 01:37:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 01:37:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:37:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:37:51,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:37:51,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:37:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:37:54,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:37:54,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:37:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275991358] [2025-02-06 01:37:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275991358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:37:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:37:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:37:54,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754870898] [2025-02-06 01:37:54,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:37:54,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:37:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:37:54,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:37:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:37:54,763 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:37:59,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:03,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:07,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:12,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:16,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:20,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:24,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:28,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:32,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:38:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:38:32,897 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2025-02-06 01:38:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:38:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2025-02-06 01:38:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:38:32,900 INFO L225 Difference]: With dead ends: 230 [2025-02-06 01:38:32,900 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 01:38:32,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:38:32,901 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 43 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:38:32,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 318 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 37.9s Time] [2025-02-06 01:38:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 01:38:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2025-02-06 01:38:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-06 01:38:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2025-02-06 01:38:32,929 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2025-02-06 01:38:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:38:32,929 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2025-02-06 01:38:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:38:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2025-02-06 01:38:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 01:38:32,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:38:32,931 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:38:32,948 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-06 01:38:33,135 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-06 01:38:33,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:38:33,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:38:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1151353271, now seen corresponding path program 1 times [2025-02-06 01:38:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:38:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805091579] [2025-02-06 01:38:33,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:38:33,137 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-06 01:38:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:38:33,139 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-06 01:38:33,140 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-06 01:38:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 01:38:33,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 01:38:33,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:38:33,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:38:33,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:38:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:38:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 01:38:34,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:38:34,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:38:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805091579] [2025-02-06 01:38:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805091579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:38:34,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:38:34,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:38:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959646980] [2025-02-06 01:38:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:38:34,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:38:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:38:34,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:38:34,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:38:34,067 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-06 01:38:38,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []