./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-90.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 fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:48:54,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:48:54,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:48:54,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:48:54,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:48:55,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:48:55,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:48:55,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:48:55,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:48:55,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:48:55,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:48:55,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:48:55,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:48:55,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:48:55,016 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:48:55,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:48:55,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:48:55,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:48:55,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:48:55,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:48:55,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:48:55,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:48:55,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:48:55,022 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 -> fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396 [2025-01-09 13:48:55,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:48:55,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:48:55,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:48:55,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:48:55,306 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:48:55,307 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-90.i [2025-01-09 13:48:56,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a017bbb/d709167473b044d89f3416ded0de7926/FLAG38c9fcf34 [2025-01-09 13:48:56,828 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:48:56,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i [2025-01-09 13:48:56,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a017bbb/d709167473b044d89f3416ded0de7926/FLAG38c9fcf34 [2025-01-09 13:48:56,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52a017bbb/d709167473b044d89f3416ded0de7926 [2025-01-09 13:48:56,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:48:56,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:48:56,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:48:56,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:48:56,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:48:56,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:48:56" (1/1) ... [2025-01-09 13:48:56,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1515f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:56, skipping insertion in model container [2025-01-09 13:48:56,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:48:56" (1/1) ... [2025-01-09 13:48:56,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:48:57,021 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-90.i[915,928] [2025-01-09 13:48:57,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:48:57,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:48:57,111 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-90.i[915,928] [2025-01-09 13:48:57,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:48:57,170 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:48:57,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57 WrapperNode [2025-01-09 13:48:57,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:48:57,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:48:57,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:48:57,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:48:57,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,230 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-01-09 13:48:57,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:48:57,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:48:57,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:48:57,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:48:57,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,260 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-01-09 13:48:57,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:48:57,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:48:57,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:48:57,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:48:57,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (1/1) ... [2025-01-09 13:48:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:48:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:48:57,327 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-01-09 13:48:57,333 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-01-09 13:48:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:48:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:48:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:48:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:48:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:48:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:48:57,418 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:48:57,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:48:57,701 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 13:48:57,701 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:48:57,710 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:48:57,710 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:48:57,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:48:57 BoogieIcfgContainer [2025-01-09 13:48:57,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:48:57,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:48:57,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:48:57,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:48:57,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:48:56" (1/3) ... [2025-01-09 13:48:57,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b830c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:48:57, skipping insertion in model container [2025-01-09 13:48:57,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:48:57" (2/3) ... [2025-01-09 13:48:57,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b830c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:48:57, skipping insertion in model container [2025-01-09 13:48:57,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:48:57" (3/3) ... [2025-01-09 13:48:57,718 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i [2025-01-09 13:48:57,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:48:57,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:48:57,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:48:57,783 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;@41da61c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:48:57,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:48:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:48:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:48:57,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:48:57,797 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:48:57,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:48:57,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:48:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash -13392828, now seen corresponding path program 1 times [2025-01-09 13:48:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:48:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120238570] [2025-01-09 13:48:57,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:48:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:48:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:48:57,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:48:57,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:48:57,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:48:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:48:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:48:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120238570] [2025-01-09 13:48:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120238570] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:48:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154200066] [2025-01-09 13:48:58,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:48:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:48:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:48:58,070 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-01-09 13:48:58,071 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-01-09 13:48:58,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:48:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:48:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:48:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:48:58,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:48:58,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:48:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:48:58,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:48:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154200066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:48:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:48:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:48:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703348193] [2025-01-09 13:48:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:48:58,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:48:58,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:48:58,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:48:58,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:48:58,260 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:48:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:48:58,286 INFO L93 Difference]: Finished difference Result 125 states and 211 transitions. [2025-01-09 13:48:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:48:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2025-01-09 13:48:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:48:58,294 INFO L225 Difference]: With dead ends: 125 [2025-01-09 13:48:58,294 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 13:48:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-01-09 13:48:58,299 INFO L435 NwaCegarLoop]: 96 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, 96 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-01-09 13:48:58,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:48:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 13:48:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 13:48:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:48:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-01-09 13:48:58,338 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 118 [2025-01-09 13:48:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:48:58,339 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-01-09 13:48:58,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:48:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-01-09 13:48:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:48:58,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:48:58,346 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:48:58,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:48:58,546 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-01-09 13:48:58,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:48:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:48:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 776581900, now seen corresponding path program 1 times [2025-01-09 13:48:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:48:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330460478] [2025-01-09 13:48:58,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:48:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:48:58,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:48:58,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:48:58,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:48:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:48:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:48:59,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:48:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330460478] [2025-01-09 13:48:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330460478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:48:59,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:48:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:48:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524377306] [2025-01-09 13:48:59,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:48:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:48:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:48:59,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:48:59,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:48:59,331 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:48:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:48:59,577 INFO L93 Difference]: Finished difference Result 178 states and 274 transitions. [2025-01-09 13:48:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:48:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-01-09 13:48:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:48:59,580 INFO L225 Difference]: With dead ends: 178 [2025-01-09 13:48:59,582 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 13:48:59,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:48:59,583 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 62 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:48:59,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 240 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:48:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 13:48:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2025-01-09 13:48:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:48:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-01-09 13:48:59,629 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 118 [2025-01-09 13:48:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:48:59,630 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-01-09 13:48:59,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:48:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-01-09 13:48:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 13:48:59,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:48:59,634 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:48:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:48:59,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:48:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:48:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash 453623727, now seen corresponding path program 1 times [2025-01-09 13:48:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:48:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465428451] [2025-01-09 13:48:59,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:48:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:48:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:48:59,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:48:59,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:48:59,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:48:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:48:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:48:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465428451] [2025-01-09 13:48:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465428451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:48:59,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:48:59,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:48:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759961783] [2025-01-09 13:48:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:48:59,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:48:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:48:59,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:48:59,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:48:59,848 INFO L87 Difference]: Start difference. First operand 111 states and 172 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:49:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:00,004 INFO L93 Difference]: Finished difference Result 254 states and 392 transitions. [2025-01-09 13:49:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:49:00,004 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-01-09 13:49:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:00,007 INFO L225 Difference]: With dead ends: 254 [2025-01-09 13:49:00,007 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 13:49:00,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-01-09 13:49:00,008 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:00,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 254 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:49:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 13:49:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2025-01-09 13:49:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:49:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2025-01-09 13:49:00,045 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 120 [2025-01-09 13:49:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:00,049 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2025-01-09 13:49:00,049 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:49:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2025-01-09 13:49:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:49:00,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:00,051 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:49:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:49:00,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 396212620, now seen corresponding path program 1 times [2025-01-09 13:49:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039301171] [2025-01-09 13:49:00,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:00,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:49:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:49:00,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-01-09 13:49:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039301171] [2025-01-09 13:49:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039301171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061868142] [2025-01-09 13:49:00,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:00,453 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-01-09 13:49:00,455 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-01-09 13:49:00,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:49:00,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:49:00,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:00,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:00,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 13:49:00,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 13:49:01,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-01-09 13:49:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061868142] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:49:01,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:49:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2025-01-09 13:49:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578196175] [2025-01-09 13:49:01,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:49:01,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:49:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:01,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:49:01,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:49:01,345 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2025-01-09 13:49:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:01,679 INFO L93 Difference]: Finished difference Result 342 states and 498 transitions. [2025-01-09 13:49:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:49:01,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 122 [2025-01-09 13:49:01,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:01,682 INFO L225 Difference]: With dead ends: 342 [2025-01-09 13:49:01,682 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 13:49:01,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:49:01,684 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 127 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:01,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 213 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:49:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 13:49:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2025-01-09 13:49:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:49:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 279 transitions. [2025-01-09 13:49:01,723 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 279 transitions. Word has length 122 [2025-01-09 13:49:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:01,723 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 279 transitions. [2025-01-09 13:49:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2025-01-09 13:49:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 279 transitions. [2025-01-09 13:49:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:49:01,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:01,725 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:49:01,734 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-01-09 13:49:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:01,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:01,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -190593394, now seen corresponding path program 1 times [2025-01-09 13:49:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:01,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210132636] [2025-01-09 13:49:01,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:01,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:49:02,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:49:02,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:02,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:49:02,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583649179] [2025-01-09 13:49:02,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:02,012 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-01-09 13:49:02,016 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-01-09 13:49:02,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:49:02,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:49:02,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:02,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:02,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:49:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:49:02,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:49:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:02,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:49:02,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:49:02,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:49:02,379 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-01-09 13:49:02,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:02,574 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:49:02,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:49:02,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:49:02 BoogieIcfgContainer [2025-01-09 13:49:02,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:49:02,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:49:02,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:49:02,675 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:49:02,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:48:57" (3/4) ... [2025-01-09 13:49:02,679 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:49:02,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:49:02,680 INFO L158 Benchmark]: Toolchain (without parser) took 5822.96ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 67.0MB in the end (delta: 55.1MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2025-01-09 13:49:02,680 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:02,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.11ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 108.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:49:02,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.43ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:49:02,681 INFO L158 Benchmark]: Boogie Preprocessor took 64.27ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:02,682 INFO L158 Benchmark]: RCFGBuilder took 415.23ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 84.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:49:02,682 INFO L158 Benchmark]: TraceAbstraction took 4961.29ms. Allocated memory is still 167.8MB. Free memory was 83.6MB in the beginning and 68.7MB in the end (delta: 14.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-01-09 13:49:02,682 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 167.8MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:02,685 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.11ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 108.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.43ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.27ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 103.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 415.23ms. Allocated memory is still 167.8MB. Free memory was 103.2MB in the beginning and 84.0MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4961.29ms. Allocated memory is still 167.8MB. Free memory was 83.6MB in the beginning and 68.7MB in the end (delta: 14.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 167.8MB. Free memory was 68.7MB in the beginning and 67.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of bitwiseOr at line 45, overapproximation of bitwiseOr at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -32; [L23] signed long int var_1_3 = 10; [L24] signed long int var_1_4 = 64; [L25] unsigned short int var_1_11 = 64; [L26] unsigned short int var_1_12 = 8; [L27] unsigned short int var_1_13 = 5; [L28] signed short int var_1_14 = 8; [L29] unsigned short int var_1_15 = 62763; [L30] unsigned long int var_1_16 = 25; [L31] float var_1_18 = 63.25; [L32] unsigned char var_1_20 = 0; [L33] float var_1_21 = 7.8; [L34] float var_1_22 = 32.1; [L35] unsigned char var_1_23 = 0; [L36] signed long int var_1_24 = -16; [L37] signed long int last_1_var_1_1 = -32; [L38] unsigned short int last_1_var_1_11 = 64; [L39] signed short int last_1_var_1_14 = 8; [L40] unsigned long int last_1_var_1_16 = 25; [L41] float last_1_var_1_18 = 63.25; VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L132] isInitial = 1 [L133] FCALL initially() [L134] int k_loop; [L135] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L135] COND TRUE k_loop < 1 [L136] CALL updateLastVariables() [L121] last_1_var_1_1 = var_1_1 [L122] last_1_var_1_11 = var_1_11 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_16 = var_1_16 [L125] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L93] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L94] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L95] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=64] [L96] var_1_4 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L97] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L98] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L99] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L99] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L101] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L102] CALL assume_abort_if_not(var_1_12 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L102] RET assume_abort_if_not(var_1_12 <= 16384) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L105] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L105] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L106] var_1_15 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L107] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L108] CALL assume_abort_if_not(var_1_15 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L108] RET assume_abort_if_not(var_1_15 <= 65535) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L109] var_1_20 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L111] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L111] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L112] var_1_21 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L113] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L114] var_1_22 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L115] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L116] var_1_23 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L117] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L118] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L118] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L137] RET updateVariables() [L138] CALL step() [L45] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) [L52] var_1_1 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-3, var_1_4=-2] [L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18) [L61] var_1_24 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L66] unsigned short int stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, stepLocal_0=0, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L67] COND FALSE !(var_1_24 < stepLocal_0) [L78] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L80] COND TRUE var_1_18 != (var_1_18 + var_1_18) [L81] var_1_11 = ((var_1_12 + var_1_13) + 32) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L83] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1) [L88] var_1_16 = 0u VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L138] RET step() [L139] CALL, EXPR property() [L128] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L128-L129] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32768, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-3, var_1_4=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 803 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 339 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=4, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 2802 SizeOfPredicates, 3 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 4103/4284 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-01-09 13:49:02,708 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-90.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 fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:04,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:05,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:49:05,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:05,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:05,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:05,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:05,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:05,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:05,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:05,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:05,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:05,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:05,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:05,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:05,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:49:05,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:49:05,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:49:05,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:05,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:05,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:05,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:05,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:05,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:05,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:05,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:05,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:05,112 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:49:05,113 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:05,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:05,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:05,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:05,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:05,113 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 -> fac5641064dafa2cff3f5bb36fec0428c2326aea5290de8df19e073ecb1f4396 [2025-01-09 13:49:05,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:05,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:05,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:05,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:05,423 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:05,426 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-90.i [2025-01-09 13:49:06,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2643ad4f7/ba870ce893de4279ae60272f932abb5d/FLAGe2c13f75c [2025-01-09 13:49:07,056 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:07,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-90.i [2025-01-09 13:49:07,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2643ad4f7/ba870ce893de4279ae60272f932abb5d/FLAGe2c13f75c [2025-01-09 13:49:07,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2643ad4f7/ba870ce893de4279ae60272f932abb5d [2025-01-09 13:49:07,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:07,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:07,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:07,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:07,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:07,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07, skipping insertion in model container [2025-01-09 13:49:07,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:07,518 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-90.i[915,928] [2025-01-09 13:49:07,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:07,590 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:49:07,599 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-90.i[915,928] [2025-01-09 13:49:07,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:07,634 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:49:07,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07 WrapperNode [2025-01-09 13:49:07,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:07,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:07,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:49:07,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:49:07,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,690 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-01-09 13:49:07,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:07,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:49:07,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:49:07,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:49:07,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,727 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-01-09 13:49:07,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:49:07,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:49:07,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:49:07,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:49:07,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (1/1) ... [2025-01-09 13:49:07,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:07,787 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-01-09 13:49:07,795 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-01-09 13:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:49:07,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:49:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:49:07,893 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:49:07,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:49:08,695 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:49:08,696 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:49:08,705 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:49:08,705 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:49:08,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:08 BoogieIcfgContainer [2025-01-09 13:49:08,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:49:08,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:49:08,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:49:08,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:49:08,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:07" (1/3) ... [2025-01-09 13:49:08,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:08, skipping insertion in model container [2025-01-09 13:49:08,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:07" (2/3) ... [2025-01-09 13:49:08,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6419bfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:08, skipping insertion in model container [2025-01-09 13:49:08,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:08" (3/3) ... [2025-01-09 13:49:08,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i [2025-01-09 13:49:08,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:49:08,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-90.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:49:08,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:49:08,800 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;@78759a97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:49:08,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:49:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:49:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 13:49:08,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:08,813 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:49:08,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:08,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash 857386220, now seen corresponding path program 1 times [2025-01-09 13:49:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:08,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690414123] [2025-01-09 13:49:08,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:08,825 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-01-09 13:49:08,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:08,827 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-01-09 13:49:08,829 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-01-09 13:49:08,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 13:49:09,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 13:49:09,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:09,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:09,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 13:49:09,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 13:49:10,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:10,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:49:10,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690414123] [2025-01-09 13:49:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690414123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:10,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521031827] [2025-01-09 13:49:10,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:10,538 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:10,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:49:10,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:49:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2025-01-09 13:49:10,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 13:49:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 13:49:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:12,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 13:49:12,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 13:49:12,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:12,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1521031827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:12,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:49:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-01-09 13:49:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098193006] [2025-01-09 13:49:12,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:49:12,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:49:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:49:13,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:49:13,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:49:13,007 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 13:49:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:15,758 INFO L93 Difference]: Finished difference Result 229 states and 386 transitions. [2025-01-09 13:49:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 13:49:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 115 [2025-01-09 13:49:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:15,782 INFO L225 Difference]: With dead ends: 229 [2025-01-09 13:49:15,783 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 13:49:15,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2025-01-09 13:49:15,788 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 221 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:15,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 339 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 13:49:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 13:49:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2025-01-09 13:49:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 89 states have internal predecessors, (119), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:49:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2025-01-09 13:49:15,857 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 115 [2025-01-09 13:49:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:15,859 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2025-01-09 13:49:15,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 13:49:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2025-01-09 13:49:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 13:49:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:15,865 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:49:15,877 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-01-09 13:49:16,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2025-01-09 13:49:16,270 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,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:16,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1537444590, now seen corresponding path program 1 times [2025-01-09 13:49:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:16,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213079421] [2025-01-09 13:49:16,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:16,272 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-01-09 13:49:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:16,274 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-01-09 13:49:16,275 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-01-09 13:49:16,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 13:49:16,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 13:49:16,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:16,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:16,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 13:49:16,621 INFO L279 TraceCheckSpWp]: Computing forward predicates...