./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.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-1loop_file-17.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 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:49:57,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:49:57,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:49:57,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:49:57,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:49:57,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:49:57,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:49:57,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:49:57,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:49:57,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:49:57,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:49:57,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:49:57,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:49:57,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:49:57,498 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:49:57,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:49:57,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:49:57,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:57,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:49:57,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:57,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:49:57,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:49:57,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:49:57,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:49:57,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:49:57,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:49:57,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:49:57,502 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 -> 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 [2025-01-09 12:49:57,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:49:57,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:49:57,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:49:57,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:49:57,773 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:49:57,773 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-1loop_file-17.i [2025-01-09 12:49:58,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fff4342ca/8a18c22e091349fe8264b63dfb01a259/FLAG0e6c87427 [2025-01-09 12:49:59,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:49:59,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-01-09 12:49:59,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fff4342ca/8a18c22e091349fe8264b63dfb01a259/FLAG0e6c87427 [2025-01-09 12:49:59,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fff4342ca/8a18c22e091349fe8264b63dfb01a259 [2025-01-09 12:49:59,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:49:59,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:49:59,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:49:59,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:49:59,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:49:59,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300332b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59, skipping insertion in model container [2025-01-09 12:49:59,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:49:59,589 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-1loop_file-17.i[916,929] [2025-01-09 12:49:59,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:49:59,688 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:49:59,696 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-1loop_file-17.i[916,929] [2025-01-09 12:49:59,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:49:59,748 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:49:59,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59 WrapperNode [2025-01-09 12:49:59,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:49:59,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:49:59,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:49:59,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:49:59,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,802 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2025-01-09 12:49:59,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:49:59,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:49:59,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:49:59,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:49:59,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,812 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,827 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 12:49:59,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:49:59,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:49:59,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:49:59,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:49:59,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (1/1) ... [2025-01-09 12:49:59,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:59,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:49:59,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:49:59,889 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 12:49:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:49:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:49:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:49:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:49:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:49:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:49:59,984 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:49:59,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:50:00,324 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 12:50:00,324 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:50:00,331 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:50:00,331 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:50:00,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:00 BoogieIcfgContainer [2025-01-09 12:50:00,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:50:00,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:50:00,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:50:00,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:50:00,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:49:59" (1/3) ... [2025-01-09 12:50:00,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9b5d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:00, skipping insertion in model container [2025-01-09 12:50:00,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:59" (2/3) ... [2025-01-09 12:50:00,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9b5d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:00, skipping insertion in model container [2025-01-09 12:50:00,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:00" (3/3) ... [2025-01-09 12:50:00,338 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-01-09 12:50:00,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:50:00,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:50:00,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:50:00,392 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;@62121e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:50:00,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:50:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:50:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 12:50:00,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:00,402 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:00,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 806906293, now seen corresponding path program 1 times [2025-01-09 12:50:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:00,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599768849] [2025-01-09 12:50:00,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:00,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:00,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 12:50:00,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 12:50:00,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:00,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:50:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599768849] [2025-01-09 12:50:00,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599768849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907564362] [2025-01-09 12:50:00,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:00,678 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 12:50:00,680 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 12:50:00,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 12:50:00,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 12:50:00,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:00,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:00,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:50:00,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:50:00,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907564362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:50:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:50:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553472063] [2025-01-09 12:50:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:50:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:00,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:50:00,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:50:00,875 INFO L87 Difference]: Start difference. First operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:50:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:00,893 INFO L93 Difference]: Finished difference Result 187 states and 309 transitions. [2025-01-09 12:50:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:50:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2025-01-09 12:50:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:00,899 INFO L225 Difference]: With dead ends: 187 [2025-01-09 12:50:00,900 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 12:50:00,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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 12:50:00,904 INFO L435 NwaCegarLoop]: 142 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, 142 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 12:50:00,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 12:50:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 12:50:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:50:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2025-01-09 12:50:00,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 167 [2025-01-09 12:50:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:00,934 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2025-01-09 12:50:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:50:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2025-01-09 12:50:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 12:50:00,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:00,936 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:00,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:50:01,137 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 12:50:01,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 659502337, now seen corresponding path program 1 times [2025-01-09 12:50:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831222288] [2025-01-09 12:50:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 12:50:01,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 12:50:01,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:01,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:50:01,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831222288] [2025-01-09 12:50:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831222288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:01,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:01,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:50:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459620217] [2025-01-09 12:50:01,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:01,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:01,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:01,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:01,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:01,588 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:01,799 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2025-01-09 12:50:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:50:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-01-09 12:50:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:01,802 INFO L225 Difference]: With dead ends: 282 [2025-01-09 12:50:01,802 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 12:50:01,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:50:01,803 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 200 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:01,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 378 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 12:50:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2025-01-09 12:50:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 127 states have internal predecessors, (175), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:50:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 271 transitions. [2025-01-09 12:50:01,840 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 271 transitions. Word has length 167 [2025-01-09 12:50:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:01,841 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 271 transitions. [2025-01-09 12:50:01,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 271 transitions. [2025-01-09 12:50:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:50:01,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:01,846 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:01,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:50:01,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:01,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:01,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1888742382, now seen corresponding path program 1 times [2025-01-09 12:50:01,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:01,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393251437] [2025-01-09 12:50:01,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:01,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:01,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:01,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:01,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:50:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393251437] [2025-01-09 12:50:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393251437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:50:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577995330] [2025-01-09 12:50:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:50:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:03,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:50:03,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:03,013 INFO L87 Difference]: Start difference. First operand 178 states and 271 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:03,692 INFO L93 Difference]: Finished difference Result 566 states and 857 transitions. [2025-01-09 12:50:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:50:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-01-09 12:50:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:03,699 INFO L225 Difference]: With dead ends: 566 [2025-01-09 12:50:03,699 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 12:50:03,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:50:03,703 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 222 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:03,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 649 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:50:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 12:50:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 317. [2025-01-09 12:50:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 241 states have (on average 1.4149377593360997) internal successors, (341), 241 states have internal predecessors, (341), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:50:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 485 transitions. [2025-01-09 12:50:03,752 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 485 transitions. Word has length 168 [2025-01-09 12:50:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:03,753 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 485 transitions. [2025-01-09 12:50:03,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 485 transitions. [2025-01-09 12:50:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:50:03,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:03,755 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:03,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:50:03,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:03,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 199798640, now seen corresponding path program 1 times [2025-01-09 12:50:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798910493] [2025-01-09 12:50:03,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:03,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:03,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:03,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:03,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:50:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798910493] [2025-01-09 12:50:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798910493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:04,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:50:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127416595] [2025-01-09 12:50:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:04,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:04,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:04,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:04,068 INFO L87 Difference]: Start difference. First operand 317 states and 485 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:04,471 INFO L93 Difference]: Finished difference Result 958 states and 1474 transitions. [2025-01-09 12:50:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:50:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-01-09 12:50:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:04,478 INFO L225 Difference]: With dead ends: 958 [2025-01-09 12:50:04,478 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 12:50:04,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:04,480 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 238 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:04,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 428 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:50:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 12:50:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 296. [2025-01-09 12:50:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 220 states have (on average 1.3863636363636365) internal successors, (305), 220 states have internal predecessors, (305), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:50:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 449 transitions. [2025-01-09 12:50:04,537 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 449 transitions. Word has length 168 [2025-01-09 12:50:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:04,538 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 449 transitions. [2025-01-09 12:50:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 449 transitions. [2025-01-09 12:50:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:50:04,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:04,540 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:04,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:50:04,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:04,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 59250030, now seen corresponding path program 1 times [2025-01-09 12:50:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160929296] [2025-01-09 12:50:04,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:04,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:04,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:04,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:50:04,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:04,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160929296] [2025-01-09 12:50:04,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160929296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48818891] [2025-01-09 12:50:04,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:04,769 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 12:50:04,771 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 12:50:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:04,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:50:04,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-01-09 12:50:05,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:50:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:50:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48818891] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:50:05,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:50:05,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 12:50:05,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468269313] [2025-01-09 12:50:05,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:50:05,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:50:05,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:05,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:50:05,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:05,360 INFO L87 Difference]: Start difference. First operand 296 states and 449 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 12:50:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:05,527 INFO L93 Difference]: Finished difference Result 561 states and 835 transitions. [2025-01-09 12:50:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:50:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 168 [2025-01-09 12:50:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:05,530 INFO L225 Difference]: With dead ends: 561 [2025-01-09 12:50:05,530 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 12:50:05,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 333 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:50:05,531 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 134 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:05,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 285 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:50:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 12:50:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 308. [2025-01-09 12:50:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 229 states have (on average 1.3493449781659388) internal successors, (309), 229 states have internal predecessors, (309), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:50:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 453 transitions. [2025-01-09 12:50:05,558 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 453 transitions. Word has length 168 [2025-01-09 12:50:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:05,558 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 453 transitions. [2025-01-09 12:50:05,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 12:50:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 453 transitions. [2025-01-09 12:50:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:50:05,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:05,561 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:05,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:50:05,761 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 12:50:05,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:05,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -74763476, now seen corresponding path program 1 times [2025-01-09 12:50:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803465333] [2025-01-09 12:50:05,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:05,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:05,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:50:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602460272] [2025-01-09 12:50:05,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:05,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:05,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:05,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:50:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:50:05,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:50:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:50:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:06,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:06,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 12:50:06,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:50:06,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803465333] [2025-01-09 12:50:06,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:50:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602460272] [2025-01-09 12:50:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602460272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:06,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251349128] [2025-01-09 12:50:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:06,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:06,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:06,497 INFO L87 Difference]: Start difference. First operand 308 states and 453 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:06,660 INFO L93 Difference]: Finished difference Result 678 states and 996 transitions. [2025-01-09 12:50:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:50:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-01-09 12:50:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:06,663 INFO L225 Difference]: With dead ends: 678 [2025-01-09 12:50:06,663 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 12:50:06,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:06,664 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 95 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:06,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 460 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:50:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 12:50:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 308. [2025-01-09 12:50:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 229 states have (on average 1.3449781659388647) internal successors, (308), 229 states have internal predecessors, (308), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:50:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 452 transitions. [2025-01-09 12:50:06,697 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 452 transitions. Word has length 168 [2025-01-09 12:50:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:06,698 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 452 transitions. [2025-01-09 12:50:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 452 transitions. [2025-01-09 12:50:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:50:06,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:06,700 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:06,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 12:50:06,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:06,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -293197594, now seen corresponding path program 1 times [2025-01-09 12:50:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:06,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551483931] [2025-01-09 12:50:06,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:06,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:50:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:50:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:06,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:50:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621640545] [2025-01-09 12:50:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:06,990 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:50:06,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:50:07,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:50:07,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:50:07,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:07,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:50:07,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:50:07,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:50:07,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:50:07,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:07,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:50:07,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:50:07,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:50:07,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:50:07,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 12:50:07,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 12:50:07,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:50:07,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:50:07,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:50:07 BoogieIcfgContainer [2025-01-09 12:50:07,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:50:07,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:50:07,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:50:07,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:50:07,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:00" (3/4) ... [2025-01-09 12:50:07,578 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:50:07,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:50:07,580 INFO L158 Benchmark]: Toolchain (without parser) took 8096.88ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 113.2MB in the beginning and 301.3MB in the end (delta: -188.2MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.35ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 96.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.76ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 91.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: RCFGBuilder took 477.78ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 53.5MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:50:07,580 INFO L158 Benchmark]: TraceAbstraction took 7240.62ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 52.3MB in the beginning and 305.5MB in the end (delta: -253.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:50:07,581 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 369.1MB. Free memory was 301.5MB in the beginning and 301.3MB in the end (delta: 177.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:50:07,582 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.35ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 96.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.76ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 91.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 84.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 477.78ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 53.5MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7240.62ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 52.3MB in the beginning and 305.5MB in the end (delta: -253.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 369.1MB. Free memory was 301.5MB in the beginning and 301.3MB in the end (delta: 177.5kB). 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 114, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someUnaryDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryArithmeticFLOAToperation at line 84, overapproximation of someBinaryArithmeticFLOAToperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_8 = 0; [L24] unsigned char var_1_9 = 1; [L25] signed short int var_1_10 = 1000; [L26] signed long int var_1_11 = -10; [L27] signed short int var_1_12 = 16; [L28] signed short int var_1_14 = 0; [L29] double var_1_16 = 7.3; [L30] double var_1_17 = 0.2; [L31] float var_1_18 = 3.5; [L32] float var_1_19 = 128.2; [L33] float var_1_20 = 5.8; [L34] signed char var_1_21 = 16; [L35] unsigned char var_1_22 = 1; [L36] signed long int var_1_23 = -128; [L37] unsigned short int var_1_24 = 128; [L38] float var_1_26 = 31.25; [L39] float var_1_27 = 0.6; [L40] float var_1_28 = 127.2; [L41] float var_1_29 = 128.18; [L42] float var_1_30 = 31.8; [L43] unsigned char var_1_31 = 25; [L44] unsigned char var_1_33 = 5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 128; [L47] unsigned char last_1_var_1_1 = 1; [L48] signed short int last_1_var_1_14 = 0; [L49] signed long int last_1_var_1_23 = -128; [L50] unsigned char last_1_var_1_31 = 25; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] int k_loop; [L185] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L185] COND TRUE k_loop < 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 [L175] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L132] var_1_8 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L138] var_1_11 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L142] var_1_12 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L147] var_1_19 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_21 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_21 >= -128) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L153] var_1_27 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L155] var_1_28 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L157] var_1_29 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L159] var_1_30 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L161] var_1_33 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_33 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 <= 64) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L164] var_1_34 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L167] var_1_35 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L54] COND TRUE (-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11) [L55] var_1_10 = ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L59] signed long int stepLocal_8 = last_1_var_1_14; [L60] unsigned char stepLocal_7 = last_1_var_1_14 <= (last_1_var_1_14 * var_1_12); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_7=1, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L61] COND TRUE stepLocal_7 && last_1_var_1_1 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L62] COND FALSE !(last_1_var_1_31 <= stepLocal_8) [L69] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L74] var_1_14 = (-2 + (last_1_var_1_31 + last_1_var_1_31)) [L75] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_1=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L76] COND TRUE stepLocal_1 == (-128 * var_1_31) [L77] var_1_16 = (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L81] COND FALSE !(\read(var_1_8)) [L84] var_1_26 = ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L86] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_6=-128, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L87] COND TRUE stepLocal_6 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14)))) [L88] var_1_24 = ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L92] signed long int stepLocal_5 = 25 * var_1_14; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L93] COND TRUE ! (var_1_31 <= var_1_10) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L94] COND FALSE !(var_1_10 >= stepLocal_5) [L97] var_1_23 = ((var_1_10 + var_1_14) + var_1_24) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L100] unsigned char stepLocal_0 = ((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] COND TRUE ((var_1_31 | var_1_24) <= var_1_31) || stepLocal_0 [L102] var_1_1 = ((! 1) && var_1_8) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L106] unsigned char stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_2=0, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L107] COND TRUE ((var_1_24 + -16) * var_1_23) >= stepLocal_2 [L108] var_1_18 = (64.9f + var_1_19) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L112] signed long int stepLocal_3 = var_1_14 % var_1_21; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] EXPR var_1_31 & var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] COND TRUE stepLocal_3 >= (var_1_31 & var_1_24) [L114] var_1_20 = ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L118] unsigned long int stepLocal_4 = ~ (var_1_31 * 128u); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L119] COND FALSE !(! (var_1_10 <= var_1_23)) [L128] var_1_22 = var_1_9 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L178] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178] EXPR ((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178-L179] return (((((((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19)))) && ((! (var_1_10 <= var_1_23)) ? (var_1_1 ? (((~ (var_1_31 * 128u)) == var_1_23) ? (var_1_22 == ((unsigned char) (! var_1_9))) : 1) : (var_1_22 == ((unsigned char) var_1_9))) : (var_1_22 == ((unsigned char) var_1_9)))) && ((! (var_1_31 <= var_1_10)) ? ((var_1_10 >= (25 * var_1_14)) ? (var_1_23 == ((signed long int) ((((var_1_24) < (var_1_10)) ? (var_1_24) : (var_1_10))))) : (var_1_23 == ((signed long int) ((var_1_10 + var_1_14) + var_1_24)))) : 1)) && ((var_1_10 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14))))) ? (var_1_24 == ((unsigned short int) ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))))) : (var_1_24 == ((unsigned short int) var_1_31)))) && (var_1_8 ? (var_1_26 == ((float) (var_1_19 + ((var_1_27 + var_1_28) + var_1_17)))) : (var_1_26 == ((float) ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))))))) && (((last_1_var_1_14 <= (last_1_var_1_14 * var_1_12)) && last_1_var_1_1) ? ((last_1_var_1_31 <= last_1_var_1_14) ? (((- var_1_19) >= var_1_17) ? (var_1_31 == ((unsigned char) (128 - ((((100) < ((var_1_33 + var_1_34))) ? (100) : ((var_1_33 + var_1_34))))))) : (var_1_31 == ((unsigned char) (var_1_35 - 5)))) : (var_1_31 == ((unsigned char) var_1_33))) : (var_1_31 == ((unsigned char) var_1_33))) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=2, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 889 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1451 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1137 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 891 mSDtfsCounter, 1137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 676 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=3, InterpolantAutomatonStates: 38, 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, 6 MinimizatonAttempts, 618 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1847 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 5371 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1202 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 9692/9936 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 12:50:07,605 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-1loop_file-17.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 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:50:09,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:50:09,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:50:09,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:50:09,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:50:09,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:50:09,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:50:09,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:50:09,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:50:09,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:50:09,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:50:09,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:50:09,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:50:09,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:50:09,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:50:09,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:09,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:09,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:50:09,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:50:09,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:50:09,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:50:09,715 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 -> 86663a1cbbd8911dd5f20f51fde174aa6fa49f328dd842d1c9d2dbaf89183ee7 [2025-01-09 12:50:09,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:50:09,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:50:09,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:50:09,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:50:09,951 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:50:09,954 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-1loop_file-17.i [2025-01-09 12:50:11,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d065fc86/e8fd3f0ed29a4727a8fce3daf953757c/FLAG92a16b6dc [2025-01-09 12:50:11,408 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:50:11,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-01-09 12:50:11,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d065fc86/e8fd3f0ed29a4727a8fce3daf953757c/FLAG92a16b6dc [2025-01-09 12:50:11,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d065fc86/e8fd3f0ed29a4727a8fce3daf953757c [2025-01-09 12:50:11,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:50:11,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:50:11,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:11,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:50:11,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:50:11,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adbb5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11, skipping insertion in model container [2025-01-09 12:50:11,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:50:11,565 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-1loop_file-17.i[916,929] [2025-01-09 12:50:11,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:11,632 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:50:11,643 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-1loop_file-17.i[916,929] [2025-01-09 12:50:11,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:11,699 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:50:11,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11 WrapperNode [2025-01-09 12:50:11,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:11,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:11,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:50:11,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:50:11,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,750 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 12:50:11,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:11,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:50:11,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:50:11,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:50:11,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,769 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 12:50:11,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:50:11,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:50:11,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:50:11,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:50:11,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (1/1) ... [2025-01-09 12:50:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:11,812 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 12:50:11,817 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 12:50:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:50:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:50:11,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:50:11,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:50:11,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:50:11,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:50:11,906 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:50:11,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:50:25,586 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 12:50:25,586 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:50:25,594 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:50:25,596 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:50:25,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:25 BoogieIcfgContainer [2025-01-09 12:50:25,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:50:25,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:50:25,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:50:25,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:50:25,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:50:11" (1/3) ... [2025-01-09 12:50:25,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e365275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:25, skipping insertion in model container [2025-01-09 12:50:25,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:11" (2/3) ... [2025-01-09 12:50:25,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e365275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:25, skipping insertion in model container [2025-01-09 12:50:25,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:25" (3/3) ... [2025-01-09 12:50:25,606 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i [2025-01-09 12:50:25,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:50:25,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-17.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:50:25,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:50:25,665 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;@33bf8945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:50:25,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:50:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:50:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:50:25,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:25,676 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:25,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:25,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash -609637538, now seen corresponding path program 1 times [2025-01-09 12:50:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:50:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66162616] [2025-01-09 12:50:25,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:25,714 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 12:50:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:50:25,717 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 12:50:25,720 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 12:50:25,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:50:26,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:50:26,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:26,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:50:26,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-01-09 12:50:26,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:26,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:50:26,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66162616] [2025-01-09 12:50:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66162616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:26,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:26,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:50:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407099087] [2025-01-09 12:50:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:26,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:50:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:50:26,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:50:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:50:26,611 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:50:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:26,628 INFO L93 Difference]: Finished difference Result 155 states and 259 transitions. [2025-01-09 12:50:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:50:26,630 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 12:50:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:26,634 INFO L225 Difference]: With dead ends: 155 [2025-01-09 12:50:26,634 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 12:50:26,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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 12:50:26,638 INFO L435 NwaCegarLoop]: 117 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, 117 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 12:50:26,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 12:50:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 12:50:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:50:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2025-01-09 12:50:26,674 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 161 [2025-01-09 12:50:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2025-01-09 12:50:26,674 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:50:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2025-01-09 12:50:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:50:26,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:26,678 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:26,711 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 12:50:26,878 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 12:50:26,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 159244202, now seen corresponding path program 1 times [2025-01-09 12:50:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:50:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275016143] [2025-01-09 12:50:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:26,880 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 12:50:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:50:26,883 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 12:50:26,886 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 12:50:26,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:50:27,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:50:27,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:27,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:27,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:50:27,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:50:33,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:33,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:50:33,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275016143] [2025-01-09 12:50:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275016143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669854442] [2025-01-09 12:50:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:50:33,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:33,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:33,216 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:38,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:50:42,472 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 12:50:46,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:50:51,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:50:55,121 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 12:50:59,126 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 12:50:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:59,127 INFO L93 Difference]: Finished difference Result 223 states and 337 transitions. [2025-01-09 12:50:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:50:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 12:50:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:59,212 INFO L225 Difference]: With dead ends: 223 [2025-01-09 12:50:59,212 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 12:50:59,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:59,213 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 71 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:59,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 371 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.7s Time] [2025-01-09 12:50:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 12:50:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2025-01-09 12:50:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:50:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-01-09 12:50:59,245 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 161 [2025-01-09 12:50:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:59,246 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-01-09 12:50:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:50:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-01-09 12:50:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:50:59,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:59,250 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:59,279 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 12:50:59,454 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 12:50:59,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:59,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:59,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1379396956, now seen corresponding path program 1 times [2025-01-09 12:50:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:50:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871086809] [2025-01-09 12:50:59,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:59,456 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 12:50:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:50:59,458 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 12:50:59,459 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 12:50:59,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:51:00,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:51:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:00,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:51:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-01-09 12:51:04,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:51:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:51:08,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871086809] [2025-01-09 12:51:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871086809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:51:08,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:51:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 12:51:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109848598] [2025-01-09 12:51:08,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:51:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:51:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:51:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:08,799 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 12:51:16,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:51:20,518 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 12:51:24,522 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 12:51:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:24,525 INFO L93 Difference]: Finished difference Result 212 states and 310 transitions. [2025-01-09 12:51:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:51:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 162 [2025-01-09 12:51:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:24,614 INFO L225 Difference]: With dead ends: 212 [2025-01-09 12:51:24,614 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 12:51:24,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:51:24,615 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:24,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 210 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2025-01-09 12:51:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 12:51:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2025-01-09 12:51:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:51:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 190 transitions. [2025-01-09 12:51:24,627 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 190 transitions. Word has length 162 [2025-01-09 12:51:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:24,627 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 190 transitions. [2025-01-09 12:51:24,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 12:51:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 190 transitions. [2025-01-09 12:51:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:51:24,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:24,629 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:24,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 12:51:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:51:24,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:24,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -208950946, now seen corresponding path program 1 times [2025-01-09 12:51:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:51:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133489414] [2025-01-09 12:51:24,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:24,831 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 12:51:24,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:51:24,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:51:24,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 12:51:24,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:51:25,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:51:25,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:25,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:25,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:51:25,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:51:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:51:35,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:51:35,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:51:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133489414] [2025-01-09 12:51:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133489414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:35,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:35,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:51:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4385985] [2025-01-09 12:51:35,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:35,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:51:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:51:35,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:51:35,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:51:35,768 INFO L87 Difference]: Start difference. First operand 131 states and 190 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)