./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.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_100-while_file-49.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 eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:07:07,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:07:07,124 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:07:07,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:07:07,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:07:07,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:07:07,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:07:07,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:07:07,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:07:07,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:07:07,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:07:07,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:07:07,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:07:07,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:07:07,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:07:07,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:07,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:07,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:07:07,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:07:07,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:07:07,146 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 -> eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 [2025-01-09 13:07:07,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:07:07,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:07:07,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:07:07,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:07:07,388 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:07:07,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:08,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/611b53f79/e69ac2c265104e71ae4ed9aca6896179/FLAG8daf97caf [2025-01-09 13:07:08,787 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:07:08,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:08,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/611b53f79/e69ac2c265104e71ae4ed9aca6896179/FLAG8daf97caf [2025-01-09 13:07:09,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/611b53f79/e69ac2c265104e71ae4ed9aca6896179 [2025-01-09 13:07:09,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:07:09,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:07:09,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:07:09,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:07:09,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:07:09,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772b38d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09, skipping insertion in model container [2025-01-09 13:07:09,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:07:09,237 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_100-while_file-49.i[916,929] [2025-01-09 13:07:09,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:07:09,329 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:07:09,345 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_100-while_file-49.i[916,929] [2025-01-09 13:07:09,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:07:09,384 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:07:09,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09 WrapperNode [2025-01-09 13:07:09,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:07:09,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:07:09,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:07:09,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:07:09,390 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:07:09" (1/1) ... [2025-01-09 13:07:09,401 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:07:09" (1/1) ... [2025-01-09 13:07:09,432 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-01-09 13:07:09,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:07:09,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:07:09,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:07:09,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:07:09,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,458 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:07:09,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:07:09,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:07:09,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:07:09,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:07:09,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (1/1) ... [2025-01-09 13:07:09,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:09,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:07:09,514 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:07:09,519 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:07:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:07:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:07:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:07:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:07:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:07:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:07:09,602 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:07:09,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:07:09,877 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 13:07:09,877 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:07:09,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:07:09,884 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:07:09,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:07:09 BoogieIcfgContainer [2025-01-09 13:07:09,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:07:09,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:07:09,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:07:09,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:07:09,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:07:09" (1/3) ... [2025-01-09 13:07:09,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e5d92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:07:09, skipping insertion in model container [2025-01-09 13:07:09,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:09" (2/3) ... [2025-01-09 13:07:09,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e5d92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:07:09, skipping insertion in model container [2025-01-09 13:07:09,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:07:09" (3/3) ... [2025-01-09 13:07:09,890 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:09,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:07:09,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:07:09,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:07:09,953 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;@13aeab4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:07:09,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:07:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:07:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 13:07:09,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:09,968 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:09,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:09,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 972549223, now seen corresponding path program 1 times [2025-01-09 13:07:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:07:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307631804] [2025-01-09 13:07:09,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:07:10,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:10,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:10,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:10,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 13:07:10,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:07:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307631804] [2025-01-09 13:07:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307631804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:07:10,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094020256] [2025-01-09 13:07:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:10,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:07:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:07:10,275 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:07:10,284 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:07:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:10,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:10,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:10,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:10,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:07:10,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:07:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 13:07:10,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:07:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094020256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:07:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:07:10,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640446403] [2025-01-09 13:07:10,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:07:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:07:10,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:07:10,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:07:10,533 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:07:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:07:10,561 INFO L93 Difference]: Finished difference Result 164 states and 285 transitions. [2025-01-09 13:07:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:07:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 13:07:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:07:10,568 INFO L225 Difference]: With dead ends: 164 [2025-01-09 13:07:10,569 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 13:07:10,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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:07:10,574 INFO L435 NwaCegarLoop]: 127 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, 127 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:07:10,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:07:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 13:07:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 13:07:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:07:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-01-09 13:07:10,611 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-01-09 13:07:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:07:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-01-09 13:07:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:07:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-01-09 13:07:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 13:07:10,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:10,614 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:10,622 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:07:10,815 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:07:10,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:10,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1239179415, now seen corresponding path program 1 times [2025-01-09 13:07:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:07:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130930424] [2025-01-09 13:07:10,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:07:10,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:10,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:10,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:10,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 13:07:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:07:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130930424] [2025-01-09 13:07:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130930424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:07:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:07:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773491627] [2025-01-09 13:07:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:07:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:07:11,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:07:11,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:07:11,972 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:07:12,464 INFO L93 Difference]: Finished difference Result 269 states and 414 transitions. [2025-01-09 13:07:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:07:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 13:07:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:07:12,470 INFO L225 Difference]: With dead ends: 269 [2025-01-09 13:07:12,470 INFO L226 Difference]: Without dead ends: 190 [2025-01-09 13:07:12,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:07:12,474 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 140 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:07:12,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 607 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:07:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-09 13:07:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2025-01-09 13:07:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 120 states have (on average 1.375) internal successors, (165), 122 states have internal predecessors, (165), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 13:07:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 285 transitions. [2025-01-09 13:07:12,532 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 285 transitions. Word has length 171 [2025-01-09 13:07:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:07:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 285 transitions. [2025-01-09 13:07:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 285 transitions. [2025-01-09 13:07:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 13:07:12,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:12,534 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:07:12,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1940243993, now seen corresponding path program 1 times [2025-01-09 13:07:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:07:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895857658] [2025-01-09 13:07:12,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:07:12,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:12,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:12,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:12,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 13:07:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:07:12,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895857658] [2025-01-09 13:07:12,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895857658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:12,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:07:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:07:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010703380] [2025-01-09 13:07:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:07:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:07:12,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:07:12,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:07:12,764 INFO L87 Difference]: Start difference. First operand 184 states and 285 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:07:12,898 INFO L93 Difference]: Finished difference Result 507 states and 782 transitions. [2025-01-09 13:07:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:07:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 13:07:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:07:12,903 INFO L225 Difference]: With dead ends: 507 [2025-01-09 13:07:12,906 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 13:07:12,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:07:12,907 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:07:12,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 305 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:07:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 13:07:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 240. [2025-01-09 13:07:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 163 states have (on average 1.392638036809816) internal successors, (227), 166 states have internal predecessors, (227), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 13:07:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2025-01-09 13:07:12,956 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 171 [2025-01-09 13:07:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:07:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 371 transitions. [2025-01-09 13:07:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 371 transitions. [2025-01-09 13:07:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 13:07:12,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:12,962 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:07:12,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1148350729, now seen corresponding path program 1 times [2025-01-09 13:07:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:07:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340514565] [2025-01-09 13:07:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:07:12,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 13:07:13,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 13:07:13,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:13,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 13:07:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:07:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340514565] [2025-01-09 13:07:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340514565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:13,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:07:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:07:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242441832] [2025-01-09 13:07:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:13,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:07:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:07:13,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:07:13,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:07:13,879 INFO L87 Difference]: Start difference. First operand 240 states and 371 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:07:14,592 INFO L93 Difference]: Finished difference Result 624 states and 954 transitions. [2025-01-09 13:07:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:07:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 13:07:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:07:14,597 INFO L225 Difference]: With dead ends: 624 [2025-01-09 13:07:14,597 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 13:07:14,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:07:14,599 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 298 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:07:14,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 544 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:07:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 13:07:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2025-01-09 13:07:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 172 states have (on average 1.3953488372093024) internal successors, (240), 175 states have internal predecessors, (240), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 13:07:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 384 transitions. [2025-01-09 13:07:14,643 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 384 transitions. Word has length 172 [2025-01-09 13:07:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:07:14,643 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 384 transitions. [2025-01-09 13:07:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 384 transitions. [2025-01-09 13:07:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 13:07:14,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:14,645 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:07:14,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:14,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash -890185291, now seen corresponding path program 1 times [2025-01-09 13:07:14,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:07:14,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560939752] [2025-01-09 13:07:14,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:14,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:07:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 13:07:14,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 13:07:14,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:14,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:07:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993094204] [2025-01-09 13:07:14,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:14,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:07:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:07:14,794 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:07:14,796 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:07:14,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 13:07:15,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 13:07:15,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:07:15,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:07:15,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 13:07:15,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 13:07:15,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:15,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:07:15,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:07:15,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:07:15,404 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:07:15,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:07:15,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:07:15,608 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:07:15,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:07:15,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:07:15 BoogieIcfgContainer [2025-01-09 13:07:15,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:07:15,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:07:15,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:07:15,676 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:07:15,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:07:09" (3/4) ... [2025-01-09 13:07:15,678 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:07:15,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:07:15,679 INFO L158 Benchmark]: Toolchain (without parser) took 6585.39ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 134.1MB in the beginning and 158.1MB in the end (delta: -24.1MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2025-01-09 13:07:15,679 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:07:15,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.25ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 118.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:07:15,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 114.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:07:15,680 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 108.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:07:15,680 INFO L158 Benchmark]: RCFGBuilder took 402.65ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 82.6MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:07:15,680 INFO L158 Benchmark]: TraceAbstraction took 5789.74ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 81.8MB in the beginning and 160.5MB in the end (delta: -78.7MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-01-09 13:07:15,681 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 302.0MB. Free memory was 160.5MB in the beginning and 158.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:07:15,682 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.25ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 118.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 114.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 108.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 402.65ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 82.6MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5789.74ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 81.8MB in the beginning and 160.5MB in the end (delta: -78.7MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 302.0MB. Free memory was 160.5MB in the beginning and 158.1MB in the end (delta: 2.4MB). 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 147. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] signed char var_1_3 = -5; [L24] double var_1_5 = 2.65; [L25] double var_1_6 = 100.375; [L26] double var_1_7 = 5.7; [L27] double var_1_8 = 0.1; [L28] double var_1_9 = 9999.4; [L29] double var_1_10 = 63.375; [L30] signed char var_1_11 = 1; [L31] double var_1_12 = 3.875; [L32] unsigned long int var_1_13 = 2; [L33] double var_1_14 = 1.375; [L34] float var_1_16 = 32.4; [L35] double var_1_17 = 255.25; [L36] unsigned char var_1_19 = 1; [L37] unsigned char var_1_20 = 1; [L38] unsigned char var_1_21 = 50; [L39] unsigned char var_1_22 = 1; [L40] unsigned char var_1_23 = 0; [L41] unsigned char var_1_24 = 0; [L42] double var_1_25 = -0.8; [L43] unsigned short int var_1_26 = 16; [L44] signed short int var_1_28 = -32; [L45] signed short int var_1_29 = 5; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] float last_1_var_1_16 = 32.4; [L49] unsigned char last_1_var_1_19 = 1; [L50] unsigned char last_1_var_1_30 = 0; VAL [isInitial=0, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L192] isInitial = 1 [L193] FCALL initially() [L195] CALL updateLastVariables() [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_19 = var_1_19 [L185] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=-5, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L141] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L142] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L143] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_6=803/8, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L144] var_1_6 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_7=57/10, var_1_8=1/10, var_1_9=49997/5] [L146] var_1_7 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_8=1/10, var_1_9=49997/5] [L148] var_1_8 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_9=49997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_9=49997/5] [L149] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20, var_1_9=49997/5] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=1, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L152] var_1_11 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L153] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L154] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L154] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L155] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L155] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_12=31/8, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L156] var_1_12 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_14=11/8, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L158] var_1_14 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L159] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=1, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L160] var_1_20 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L161] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L162] CALL assume_abort_if_not(var_1_20 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L162] RET assume_abort_if_not(var_1_20 <= 128) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=50, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L163] var_1_21 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L164] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L165] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L165] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L166] var_1_22 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L167] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L168] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L168] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L169] var_1_23 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L170] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L171] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L171] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L172] var_1_24 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L173] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L174] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L174] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=5, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L175] var_1_29 = __VERIFIER_nondet_short() [L176] CALL assume_abort_if_not(var_1_29 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L176] RET assume_abort_if_not(var_1_29 >= -16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L177] CALL assume_abort_if_not(var_1_29 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L177] RET assume_abort_if_not(var_1_29 <= 16383) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=0, var_1_3=49, var_1_5=53/20] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_6 = var_1_24; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_6=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=16, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L55] COND FALSE !(last_1_var_1_30 || stepLocal_6) [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=2, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L68] COND FALSE !((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) [L71] var_1_13 = var_1_26 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L73] unsigned short int stepLocal_0 = var_1_26; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_0=128, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=16, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L74] COND TRUE (-32 * (var_1_13 / var_1_3)) >= stepLocal_0 [L75] var_1_1 = ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L77] signed long int stepLocal_7 = - 1000; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_7=-1000, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-32, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L78] COND TRUE stepLocal_7 <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L79] var_1_28 = (var_1_29 + var_1_1) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L83] signed long int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_1=177, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_5=53/20] [L84] COND TRUE stepLocal_1 >= 32 [L85] var_1_5 = (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_10=507/8, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L89] COND TRUE var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) [L90] var_1_10 = (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L94] signed long int stepLocal_2 = var_1_26 % (var_1_20 + var_1_21); VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_2=128, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=1, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L95] COND FALSE !(stepLocal_2 <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) [L98] var_1_19 = (! var_1_22) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L100] signed char stepLocal_5 = var_1_11; [L101] unsigned short int stepLocal_4 = var_1_26; [L102] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, stepLocal_4=128, stepLocal_5=-2, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L103] COND TRUE stepLocal_4 >= var_1_20 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, stepLocal_5=-2, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49] [L104] COND FALSE !(stepLocal_5 > var_1_26) [L113] var_1_25 = var_1_8 VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_8=2] [L116] signed long int stepLocal_8 = (0 ^ var_1_1) + var_1_29; VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, stepLocal_8=-92, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=0, var_1_31=1, var_1_3=49, var_1_8=2] [L117] COND TRUE stepLocal_8 < var_1_11 [L118] var_1_30 = (var_1_22 && (var_1_19 || var_1_31)) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] [L122] COND FALSE !(var_1_25 >= var_1_9) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] [L127] COND FALSE !((var_1_5 != var_1_12) && var_1_30) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, stepLocal_3=128, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((((((((-32 * (var_1_13 / var_1_3)) >= var_1_26) ? (var_1_1 == ((signed long int) ((((var_1_3 + var_1_13) < 0 ) ? -(var_1_3 + var_1_13) : (var_1_3 + var_1_13))))) : 1) && ((var_1_1 >= 32) ? (var_1_5 == ((double) (var_1_6 - ((var_1_7 + var_1_8) + var_1_9)))) : (var_1_5 == ((double) 0.8)))) && ((var_1_3 != (var_1_1 / ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10 == ((double) (var_1_9 - ((((((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) < (var_1_7)) ? (((((var_1_6) < (var_1_12)) ? (var_1_6) : (var_1_12)))) : (var_1_7)))))) : (var_1_10 == ((double) ((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))))))) && (((var_1_6 * (var_1_8 * var_1_7)) > (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) - var_1_14)) ? (var_1_13 == ((unsigned long int) (128u + var_1_26))) : (var_1_13 == ((unsigned long int) var_1_26)))) && ((var_1_25 >= var_1_9) ? ((var_1_9 < var_1_14) ? (var_1_16 == ((float) var_1_8)) : 1) : 1)) && (((var_1_5 != var_1_12) && var_1_30) ? ((var_1_12 >= (var_1_9 * var_1_7)) ? ((var_1_11 >= var_1_26) ? (var_1_17 == ((double) var_1_12)) : (var_1_17 == ((double) var_1_7))) : (var_1_17 == ((double) var_1_6))) : 1)) && (((var_1_26 % (var_1_20 + var_1_21)) <= (~ ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_19 == ((unsigned char) (((! var_1_22) || var_1_23) || var_1_24))) : (var_1_19 == ((unsigned char) (! var_1_22))))) && ((var_1_26 >= var_1_20) ? ((var_1_11 > var_1_26) ? (((((((10) > (var_1_3)) ? (10) : (var_1_3))) + var_1_28) >= var_1_20) ? ((! var_1_19) ? (var_1_25 == ((double) (var_1_9 - var_1_8))) : 1) : (var_1_25 == ((double) var_1_9))) : (var_1_25 == ((double) var_1_8))) : 1)) && ((last_1_var_1_30 || var_1_24) ? (last_1_var_1_19 ? (var_1_26 == ((unsigned short int) ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) : ((var_1_12 == last_1_var_1_16) ? (var_1_23 ? (var_1_26 == ((unsigned short int) var_1_20)) : 1) : 1)) : (var_1_26 == ((unsigned short int) var_1_20)))) && (((- 1000) <= (var_1_21 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_28 == ((signed short int) (var_1_29 + var_1_1))) : (var_1_28 == ((signed short int) -5)))) && ((((0 ^ var_1_1) + var_1_29) < var_1_11) ? (var_1_30 == ((unsigned char) (var_1_22 && (var_1_19 || var_1_31)))) : (var_1_30 == ((unsigned char) var_1_22))) ; VAL [\result=0, isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=162/5, last_1_var_1_19=1, last_1_var_1_30=0, var_1_11=-2, var_1_13=128, var_1_16=162/5, var_1_17=1021/4, var_1_19=0, var_1_1=177, var_1_20=128, var_1_21=1, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=128, var_1_28=-92, var_1_29=-269, var_1_30=1, var_1_31=1, var_1_3=49, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 1583 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 617 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 1756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6450/6500 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:07:15,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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_100-while_file-49.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 eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:07:17,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:07:17,715 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:07:17,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:07:17,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:07:17,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:07:17,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:07:17,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:07:17,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:07:17,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:07:17,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:07:17,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:07:17,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:07:17,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:07:17,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:07:17,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:17,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:17,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:07:17,745 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:07:17,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:07:17,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:07:17,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:07:17,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:07:17,746 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 -> eeb4616c82dd418b721c618c54512d08e3a8ea8d5c6a2fdf9225b3e79e147c74 [2025-01-09 13:07:17,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:07:17,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:07:17,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:07:17,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:07:17,999 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:07:17,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:19,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da40d1e5d/ab9efd74d45546be85c74a12c4771492/FLAGd6f2a32f5 [2025-01-09 13:07:19,457 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:07:19,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:19,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da40d1e5d/ab9efd74d45546be85c74a12c4771492/FLAGd6f2a32f5 [2025-01-09 13:07:19,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da40d1e5d/ab9efd74d45546be85c74a12c4771492 [2025-01-09 13:07:19,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:07:19,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:07:19,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:07:19,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:07:19,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:07:19,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2340b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19, skipping insertion in model container [2025-01-09 13:07:19,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:07:19,613 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_100-while_file-49.i[916,929] [2025-01-09 13:07:19,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:07:19,707 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:07:19,716 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_100-while_file-49.i[916,929] [2025-01-09 13:07:19,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:07:19,779 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:07:19,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19 WrapperNode [2025-01-09 13:07:19,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:07:19,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:07:19,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:07:19,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:07:19,787 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:07:19" (1/1) ... [2025-01-09 13:07:19,800 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:07:19" (1/1) ... [2025-01-09 13:07:19,828 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-01-09 13:07:19,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:07:19,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:07:19,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:07:19,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:07:19,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,861 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:07:19,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:07:19,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:07:19,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:07:19,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:07:19,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (1/1) ... [2025-01-09 13:07:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:07:19,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:07:19,913 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:07:19,915 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:07:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:07:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:07:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:07:19,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:07:19,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:07:19,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:07:19,988 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:07:19,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:07:41,754 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 13:07:41,754 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:07:41,765 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:07:41,766 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:07:41,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:07:41 BoogieIcfgContainer [2025-01-09 13:07:41,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:07:41,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:07:41,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:07:41,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:07:41,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:07:19" (1/3) ... [2025-01-09 13:07:41,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f0d6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:07:41, skipping insertion in model container [2025-01-09 13:07:41,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:07:19" (2/3) ... [2025-01-09 13:07:41,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f0d6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:07:41, skipping insertion in model container [2025-01-09 13:07:41,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:07:41" (3/3) ... [2025-01-09 13:07:41,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-49.i [2025-01-09 13:07:41,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:07:41,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-49.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:07:41,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:07:41,832 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;@1524d286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:07:41,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:07:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:07:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 13:07:41,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:41,844 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:41,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:41,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 972549223, now seen corresponding path program 1 times [2025-01-09 13:07:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:07:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257508392] [2025-01-09 13:07:41,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:41,855 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:07:41,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:07:41,857 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:07:41,860 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:07:41,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:42,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:42,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:42,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:42,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:07:42,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:07:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-01-09 13:07:43,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:07:43,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:07:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257508392] [2025-01-09 13:07:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257508392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:07:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:07:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860201393] [2025-01-09 13:07:43,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:43,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:07:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:07:43,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:07:43,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:07:43,042 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:07:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:07:43,059 INFO L93 Difference]: Finished difference Result 164 states and 285 transitions. [2025-01-09 13:07:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:07:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 13:07:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:07:43,068 INFO L225 Difference]: With dead ends: 164 [2025-01-09 13:07:43,068 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 13:07:43,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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:07:43,071 INFO L435 NwaCegarLoop]: 127 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, 127 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:07:43,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:07:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 13:07:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 13:07:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:07:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-01-09 13:07:43,099 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 171 [2025-01-09 13:07:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:07:43,099 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-01-09 13:07:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 13:07:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-01-09 13:07:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 13:07:43,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:07:43,101 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:43,130 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:07:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:07:43,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:07:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:07:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1239179415, now seen corresponding path program 1 times [2025-01-09 13:07:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:07:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563365184] [2025-01-09 13:07:43,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:07:43,305 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:07:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:07:43,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:07:43,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 13:07:43,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 13:07:52,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 13:07:52,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:07:52,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:07:52,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:07:52,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:07:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 13:07:53,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:07:53,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:07:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563365184] [2025-01-09 13:07:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563365184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:07:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:07:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:07:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917714796] [2025-01-09 13:07:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:07:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:07:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:07:53,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:07:53,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:07:53,502 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:07:57,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:01,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:06,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:10,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:14,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:18,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:23,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:27,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:31,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:35,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:08:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:36,155 INFO L93 Difference]: Finished difference Result 215 states and 332 transitions. [2025-01-09 13:08:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:08:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 13:08:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:36,157 INFO L225 Difference]: With dead ends: 215 [2025-01-09 13:08:36,157 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 13:08:36,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:08:36,158 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:36,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 385 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 10 Unknown, 0 Unchecked, 42.5s Time] [2025-01-09 13:08:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 13:08:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-01-09 13:08:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 93 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:08:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2025-01-09 13:08:36,172 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 171 [2025-01-09 13:08:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:36,173 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2025-01-09 13:08:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 13:08:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2025-01-09 13:08:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 13:08:36,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:36,175 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:36,215 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 (3)] Ended with exit code 0 [2025-01-09 13:08:36,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:08:36,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1148350729, now seen corresponding path program 1 times [2025-01-09 13:08:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:08:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249437175] [2025-01-09 13:08:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:36,381 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:08:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:08:36,387 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:08:36,387 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:08:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 13:08:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 13:08:39,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:39,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:39,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 13:08:39,571 INFO L279 TraceCheckSpWp]: Computing forward predicates...