./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.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-59.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 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:55:33,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:55:33,797 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:55:33,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:55:33,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:55:33,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:55:33,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:55:33,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:55:33,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:55:33,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:55:33,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:55:33,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:55:33,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:55:33,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:55:33,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:55:33,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:55:33,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:55:33,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:55:33,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:55:33,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:55:33,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:55:33,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:55:33,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:55:33,831 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 -> 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 [2025-01-09 12:55:34,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:55:34,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:55:34,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:55:34,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:55:34,069 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:55:34,070 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-59.i [2025-01-09 12:55:35,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca007836e/be86bd45375d4729aead1104e739989c/FLAGf75891fc7 [2025-01-09 12:55:35,501 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:55:35,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-01-09 12:55:35,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca007836e/be86bd45375d4729aead1104e739989c/FLAGf75891fc7 [2025-01-09 12:55:35,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca007836e/be86bd45375d4729aead1104e739989c [2025-01-09 12:55:35,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:55:35,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:55:35,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:55:35,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:55:35,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:55:35,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35, skipping insertion in model container [2025-01-09 12:55:35,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:55:35,646 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-59.i[916,929] [2025-01-09 12:55:35,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:55:35,734 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:55:35,743 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-59.i[916,929] [2025-01-09 12:55:35,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:55:35,790 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:55:35,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35 WrapperNode [2025-01-09 12:55:35,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:55:35,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:55:35,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:55:35,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:55:35,795 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:55:35" (1/1) ... [2025-01-09 12:55:35,806 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:55:35" (1/1) ... [2025-01-09 12:55:35,848 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2025-01-09 12:55:35,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:55:35,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:55:35,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:55:35,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:55:35,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,885 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:55:35,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:55:35,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:55:35,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:55:35,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:55:35,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (1/1) ... [2025-01-09 12:55:35,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:55:35,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:55:35,942 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:55:35,944 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:55:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:55:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:55:35,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:55:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:55:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:55:35,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:55:36,032 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:55:36,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:55:36,442 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-01-09 12:55:36,442 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:55:36,450 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:55:36,451 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:55:36,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:36 BoogieIcfgContainer [2025-01-09 12:55:36,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:55:36,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:55:36,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:55:36,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:55:36,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:55:35" (1/3) ... [2025-01-09 12:55:36,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596bb405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:36, skipping insertion in model container [2025-01-09 12:55:36,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:55:35" (2/3) ... [2025-01-09 12:55:36,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596bb405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:55:36, skipping insertion in model container [2025-01-09 12:55:36,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:36" (3/3) ... [2025-01-09 12:55:36,462 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-01-09 12:55:36,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:55:36,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:55:36,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:55:36,529 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;@759e6d45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:55:36,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:55:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:55:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 12:55:36,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:36,542 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:36,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1685207996, now seen corresponding path program 1 times [2025-01-09 12:55:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43679184] [2025-01-09 12:55:36,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:36,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 12:55:36,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 12:55:36,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:36,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 12:55:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43679184] [2025-01-09 12:55:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43679184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810521140] [2025-01-09 12:55:36,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:36,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:55:36,842 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:55:36,843 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:55:36,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 12:55:36,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 12:55:36,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:36,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:36,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:55:37,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 12:55:37,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:55:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810521140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:37,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:55:37,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:55:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382295291] [2025-01-09 12:55:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:37,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:55:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:37,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:55:37,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:55:37,049 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:55:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:37,066 INFO L93 Difference]: Finished difference Result 215 states and 360 transitions. [2025-01-09 12:55:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:55:37,067 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2025-01-09 12:55:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:37,072 INFO L225 Difference]: With dead ends: 215 [2025-01-09 12:55:37,072 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 12:55:37,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:55:37,075 INFO L435 NwaCegarLoop]: 168 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, 168 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:55:37,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:55:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 12:55:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 12:55:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:55:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2025-01-09 12:55:37,107 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 148 [2025-01-09 12:55:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:37,108 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2025-01-09 12:55:37,108 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:55:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2025-01-09 12:55:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 12:55:37,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:37,110 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:37,117 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:55:37,311 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:55:37,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1026947074, now seen corresponding path program 1 times [2025-01-09 12:55:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600122685] [2025-01-09 12:55:37,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:37,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 12:55:37,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 12:55:37,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:37,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600122685] [2025-01-09 12:55:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600122685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:37,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:55:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514271622] [2025-01-09 12:55:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:55:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:37,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:55:37,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:37,529 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:37,612 INFO L93 Difference]: Finished difference Result 309 states and 483 transitions. [2025-01-09 12:55:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:55:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2025-01-09 12:55:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:37,616 INFO L225 Difference]: With dead ends: 309 [2025-01-09 12:55:37,616 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 12:55:37,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:37,619 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 144 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:37,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 295 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:55:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 12:55:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2025-01-09 12:55:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2025-01-09 12:55:37,677 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 148 [2025-01-09 12:55:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2025-01-09 12:55:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2025-01-09 12:55:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 12:55:37,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:37,679 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:37,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:55:37,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:37,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -395898523, now seen corresponding path program 1 times [2025-01-09 12:55:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435829271] [2025-01-09 12:55:37,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 12:55:37,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 12:55:37,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:37,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435829271] [2025-01-09 12:55:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435829271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:37,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:37,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:55:37,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441201194] [2025-01-09 12:55:37,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:37,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:55:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:37,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:55:37,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:37,909 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:37,965 INFO L93 Difference]: Finished difference Result 405 states and 623 transitions. [2025-01-09 12:55:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:55:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-01-09 12:55:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:37,969 INFO L225 Difference]: With dead ends: 405 [2025-01-09 12:55:37,969 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 12:55:37,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:37,970 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:37,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:55:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 12:55:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 12:55:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 159 states have internal predecessors, (227), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 311 transitions. [2025-01-09 12:55:37,983 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 311 transitions. Word has length 149 [2025-01-09 12:55:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:37,984 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 311 transitions. [2025-01-09 12:55:37,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 311 transitions. [2025-01-09 12:55:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:55:37,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:37,990 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:55:37,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -429298594, now seen corresponding path program 1 times [2025-01-09 12:55:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:37,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720851959] [2025-01-09 12:55:37,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:38,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:55:38,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:55:38,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:38,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720851959] [2025-01-09 12:55:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720851959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:38,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:55:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109882095] [2025-01-09 12:55:38,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:38,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:55:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:38,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:55:38,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:55:38,201 INFO L87 Difference]: Start difference. First operand 204 states and 311 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:38,357 INFO L93 Difference]: Finished difference Result 717 states and 1095 transitions. [2025-01-09 12:55:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:55:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 12:55:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:38,360 INFO L225 Difference]: With dead ends: 717 [2025-01-09 12:55:38,360 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 12:55:38,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:55:38,361 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 220 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:38,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 549 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:55:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 12:55:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 403. [2025-01-09 12:55:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 314 states have (on average 1.4267515923566878) internal successors, (448), 314 states have internal predecessors, (448), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 12:55:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 616 transitions. [2025-01-09 12:55:38,407 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 616 transitions. Word has length 150 [2025-01-09 12:55:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 616 transitions. [2025-01-09 12:55:38,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2025-01-09 12:55:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:55:38,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:38,410 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:38,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:55:38,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:38,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash 80174496, now seen corresponding path program 1 times [2025-01-09 12:55:38,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:38,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217030143] [2025-01-09 12:55:38,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:38,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:55:38,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:55:38,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:38,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217030143] [2025-01-09 12:55:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217030143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:55:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359695654] [2025-01-09 12:55:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:38,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:55:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:38,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:55:38,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:55:38,670 INFO L87 Difference]: Start difference. First operand 403 states and 616 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:38,988 INFO L93 Difference]: Finished difference Result 1025 states and 1565 transitions. [2025-01-09 12:55:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:55:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 12:55:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:38,996 INFO L225 Difference]: With dead ends: 1025 [2025-01-09 12:55:38,996 INFO L226 Difference]: Without dead ends: 625 [2025-01-09 12:55:38,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:55:38,997 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 111 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:38,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 509 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:55:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-01-09 12:55:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2025-01-09 12:55:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 488 states have (on average 1.4118852459016393) internal successors, (689), 488 states have internal predecessors, (689), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 12:55:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 941 transitions. [2025-01-09 12:55:39,070 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 941 transitions. Word has length 150 [2025-01-09 12:55:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:39,071 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 941 transitions. [2025-01-09 12:55:39,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 941 transitions. [2025-01-09 12:55:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:55:39,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:39,074 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:55:39,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -853815813, now seen corresponding path program 1 times [2025-01-09 12:55:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815010799] [2025-01-09 12:55:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:39,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:55:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:55:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:39,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815010799] [2025-01-09 12:55:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815010799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:39,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:39,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:55:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802034868] [2025-01-09 12:55:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:55:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:39,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:55:39,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:55:39,257 INFO L87 Difference]: Start difference. First operand 621 states and 941 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:39,302 INFO L93 Difference]: Finished difference Result 1251 states and 1897 transitions. [2025-01-09 12:55:39,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:55:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 12:55:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:39,305 INFO L225 Difference]: With dead ends: 1251 [2025-01-09 12:55:39,305 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 12:55:39,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:55:39,307 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:39,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:55:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 12:55:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-01-09 12:55:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 500 states have (on average 1.402) internal successors, (701), 500 states have internal predecessors, (701), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 12:55:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 953 transitions. [2025-01-09 12:55:39,359 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 953 transitions. Word has length 150 [2025-01-09 12:55:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:39,359 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 953 transitions. [2025-01-09 12:55:39,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 953 transitions. [2025-01-09 12:55:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:55:39,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:39,361 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:39,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:55:39,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash -173757443, now seen corresponding path program 1 times [2025-01-09 12:55:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:39,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413184577] [2025-01-09 12:55:39,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:39,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:55:39,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:55:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413184577] [2025-01-09 12:55:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413184577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:55:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838808683] [2025-01-09 12:55:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:55:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:39,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:55:39,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:55:39,973 INFO L87 Difference]: Start difference. First operand 633 states and 953 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:40,248 INFO L93 Difference]: Finished difference Result 1463 states and 2201 transitions. [2025-01-09 12:55:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:55:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 12:55:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:40,252 INFO L225 Difference]: With dead ends: 1463 [2025-01-09 12:55:40,252 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 12:55:40,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:55:40,254 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 79 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 292 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:55:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 12:55:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 755. [2025-01-09 12:55:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 622 states have (on average 1.4212218649517685) internal successors, (884), 622 states have internal predecessors, (884), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 12:55:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1136 transitions. [2025-01-09 12:55:40,314 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1136 transitions. Word has length 150 [2025-01-09 12:55:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:40,315 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1136 transitions. [2025-01-09 12:55:40,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1136 transitions. [2025-01-09 12:55:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 12:55:40,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:40,320 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:55:40,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash -170486452, now seen corresponding path program 1 times [2025-01-09 12:55:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087584364] [2025-01-09 12:55:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:40,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 12:55:40,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 12:55:40,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:40,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:55:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:42,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087584364] [2025-01-09 12:55:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087584364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326871891] [2025-01-09 12:55:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:55:42,222 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:55:42,229 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:55:42,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 12:55:42,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 12:55:42,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:42,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:42,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:55:42,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:55:42,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:55:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326871891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:55:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2025-01-09 12:55:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691825512] [2025-01-09 12:55:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:55:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:42,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:55:42,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:55:42,450 INFO L87 Difference]: Start difference. First operand 755 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:42,670 INFO L93 Difference]: Finished difference Result 1027 states and 1521 transitions. [2025-01-09 12:55:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:55:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2025-01-09 12:55:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:42,675 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 12:55:42,675 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 12:55:42,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:55:42,678 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 225 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:42,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 317 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:55:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 12:55:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2025-01-09 12:55:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.336405529953917) internal successors, (290), 217 states have internal predecessors, (290), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 374 transitions. [2025-01-09 12:55:42,697 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 374 transitions. Word has length 155 [2025-01-09 12:55:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:42,699 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 374 transitions. [2025-01-09 12:55:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 374 transitions. [2025-01-09 12:55:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 12:55:42,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:42,700 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:42,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:55:42,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:42,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:42,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1598705246, now seen corresponding path program 1 times [2025-01-09 12:55:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673680299] [2025-01-09 12:55:42,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:42,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 12:55:42,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 12:55:42,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:42,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673680299] [2025-01-09 12:55:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673680299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:55:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50965062] [2025-01-09 12:55:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:55:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:42,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:55:42,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:42,993 INFO L87 Difference]: Start difference. First operand 264 states and 374 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:43,112 INFO L93 Difference]: Finished difference Result 736 states and 1051 transitions. [2025-01-09 12:55:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:55:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2025-01-09 12:55:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:43,115 INFO L225 Difference]: With dead ends: 736 [2025-01-09 12:55:43,115 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 12:55:43,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:55:43,116 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 116 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:43,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 255 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:55:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 12:55:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 367. [2025-01-09 12:55:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 320 states have (on average 1.35) internal successors, (432), 320 states have internal predecessors, (432), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 516 transitions. [2025-01-09 12:55:43,134 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 516 transitions. Word has length 156 [2025-01-09 12:55:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 516 transitions. [2025-01-09 12:55:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 516 transitions. [2025-01-09 12:55:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:55:43,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:43,135 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:55:43,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1560579201, now seen corresponding path program 1 times [2025-01-09 12:55:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500043988] [2025-01-09 12:55:43,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:43,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:55:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:55:43,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:55:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500043988] [2025-01-09 12:55:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500043988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:55:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:55:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:55:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124108180] [2025-01-09 12:55:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:55:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:55:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:43,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:55:43,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:55:43,215 INFO L87 Difference]: Start difference. First operand 367 states and 516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:43,428 INFO L93 Difference]: Finished difference Result 956 states and 1351 transitions. [2025-01-09 12:55:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:55:43,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2025-01-09 12:55:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:43,431 INFO L225 Difference]: With dead ends: 956 [2025-01-09 12:55:43,431 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 12:55:43,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:55:43,432 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 111 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:43,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 490 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:55:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 12:55:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 436. [2025-01-09 12:55:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 389 states have internal predecessors, (534), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 618 transitions. [2025-01-09 12:55:43,451 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 618 transitions. Word has length 157 [2025-01-09 12:55:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:43,452 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 618 transitions. [2025-01-09 12:55:43,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:55:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 618 transitions. [2025-01-09 12:55:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 12:55:43,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:43,453 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:55:43,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -369997313, now seen corresponding path program 1 times [2025-01-09 12:55:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668817343] [2025-01-09 12:55:43,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:43,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:55:43,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:55:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:55:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668817343] [2025-01-09 12:55:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668817343] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918713446] [2025-01-09 12:55:47,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:55:47,672 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:55:47,677 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:55:47,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 12:55:47,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 12:55:47,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:47,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:47,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:55:47,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-09 12:55:48,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:55:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918713446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:48,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:55:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-01-09 12:55:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258794378] [2025-01-09 12:55:48,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:55:48,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 12:55:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:55:48,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 12:55:48,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:55:48,921 INFO L87 Difference]: Start difference. First operand 436 states and 618 transitions. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 12:55:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:55:52,175 INFO L93 Difference]: Finished difference Result 1271 states and 1754 transitions. [2025-01-09 12:55:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 12:55:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 157 [2025-01-09 12:55:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:55:52,180 INFO L225 Difference]: With dead ends: 1271 [2025-01-09 12:55:52,181 INFO L226 Difference]: Without dead ends: 838 [2025-01-09 12:55:52,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 12:55:52,186 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1478 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:55:52,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 504 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 12:55:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-09 12:55:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 567. [2025-01-09 12:55:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 514 states have (on average 1.3249027237354085) internal successors, (681), 514 states have internal predecessors, (681), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:55:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 765 transitions. [2025-01-09 12:55:52,248 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 765 transitions. Word has length 157 [2025-01-09 12:55:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:55:52,248 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 765 transitions. [2025-01-09 12:55:52,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 12:55:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 765 transitions. [2025-01-09 12:55:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 12:55:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:55:52,255 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:55:52,261 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:55:52,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:52,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:55:52,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:55:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1518076710, now seen corresponding path program 1 times [2025-01-09 12:55:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:55:52,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338620907] [2025-01-09 12:55:52,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:55:52,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:55:52,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:55:52,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:52,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:55:54,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:55:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338620907] [2025-01-09 12:55:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338620907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:55:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338776983] [2025-01-09 12:55:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:55:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:55:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:55:54,190 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:55:54,191 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:55:54,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 12:55:54,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 12:55:54,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:55:54,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:55:54,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:55:54,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:55:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:55:57,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:56:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:56:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338776983] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:56:02,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:56:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 39 [2025-01-09 12:56:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767547196] [2025-01-09 12:56:02,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:56:02,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 12:56:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:56:02,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 12:56:02,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 12:56:02,318 INFO L87 Difference]: Start difference. First operand 567 states and 765 transitions. Second operand has 39 states, 39 states have (on average 4.282051282051282) internal successors, (167), 39 states have internal predecessors, (167), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 12:56:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:56:13,153 INFO L93 Difference]: Finished difference Result 3448 states and 4622 transitions. [2025-01-09 12:56:13,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-01-09 12:56:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.282051282051282) internal successors, (167), 39 states have internal predecessors, (167), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) Word has length 159 [2025-01-09 12:56:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:56:13,161 INFO L225 Difference]: With dead ends: 3448 [2025-01-09 12:56:13,162 INFO L226 Difference]: Without dead ends: 2884 [2025-01-09 12:56:13,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3971 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1822, Invalid=9950, Unknown=0, NotChecked=0, Total=11772 [2025-01-09 12:56:13,166 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 2203 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 5394 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 5558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 5394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:56:13,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 1451 Invalid, 5558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 5394 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 12:56:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2025-01-09 12:56:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1170. [2025-01-09 12:56:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1065 states have (on average 1.3276995305164319) internal successors, (1414), 1065 states have internal predecessors, (1414), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 12:56:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1582 transitions. [2025-01-09 12:56:13,233 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1582 transitions. Word has length 159 [2025-01-09 12:56:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:56:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1582 transitions. [2025-01-09 12:56:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.282051282051282) internal successors, (167), 39 states have internal predecessors, (167), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 12:56:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1582 transitions. [2025-01-09 12:56:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:56:13,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:13,235 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,248 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:56:13,435 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,SelfDestructingSolverStorable11 [2025-01-09 12:56:13,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1215961684, now seen corresponding path program 1 times [2025-01-09 12:56:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:56:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961194320] [2025-01-09 12:56:13,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:56:13,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:56:13,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:56:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:56:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38756418] [2025-01-09 12:56:13,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:13,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:56:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:56:13,526 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:13,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:56:13,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:56:13,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:56:13,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:13,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:56:13,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:56:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:56:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:56:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:56:13,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:56:13,786 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:56:13,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:56:13,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 12:56:13,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 12:56:13,991 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:14,068 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:56:14,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:56:14 BoogieIcfgContainer [2025-01-09 12:56:14,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:56:14,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:56:14,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:56:14,071 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:56:14,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:55:36" (3/4) ... [2025-01-09 12:56:14,073 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:56:14,073 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:56:14,074 INFO L158 Benchmark]: Toolchain (without parser) took 38550.47ms. Allocated memory was 167.8MB in the beginning and 830.5MB in the end (delta: 662.7MB). Free memory was 131.6MB in the beginning and 330.0MB in the end (delta: -198.4MB). Peak memory consumption was 464.1MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,074 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:56:14,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.19ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 114.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.75ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 107.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,075 INFO L158 Benchmark]: Boogie Preprocessor took 68.28ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 97.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,075 INFO L158 Benchmark]: RCFGBuilder took 534.43ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 56.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,075 INFO L158 Benchmark]: TraceAbstraction took 37614.90ms. Allocated memory was 167.8MB in the beginning and 830.5MB in the end (delta: 662.7MB). Free memory was 55.9MB in the beginning and 330.3MB in the end (delta: -274.3MB). Peak memory consumption was 388.6MB. Max. memory is 16.1GB. [2025-01-09 12:56:14,075 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 830.5MB. Free memory was 330.3MB in the beginning and 330.0MB in the end (delta: 267.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:56:14,076 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.19ms. Allocated memory is still 226.5MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.19ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 114.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.75ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 107.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.28ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 97.7MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 534.43ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 56.4MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37614.90ms. Allocated memory was 167.8MB in the beginning and 830.5MB in the end (delta: 662.7MB). Free memory was 55.9MB in the beginning and 330.3MB in the end (delta: -274.3MB). Peak memory consumption was 388.6MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 830.5MB. Free memory was 330.3MB in the beginning and 330.0MB in the end (delta: 267.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 81, overapproximation of shiftRight at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 50; [L23] unsigned char var_1_5 = 200; [L24] unsigned char var_1_6 = 64; [L25] signed short int var_1_7 = -2; [L26] signed long int var_1_8 = 16; [L27] unsigned char var_1_11 = 1; [L28] signed char var_1_12 = 8; [L29] signed char var_1_13 = 0; [L30] signed char var_1_14 = 10; [L31] signed char var_1_15 = 8; [L32] unsigned char var_1_16 = 5; [L33] unsigned char var_1_17 = 100; [L34] unsigned char var_1_18 = 25; [L35] unsigned char var_1_19 = 0; [L36] signed short int var_1_20 = -128; [L37] signed short int var_1_21 = -8; [L38] double var_1_22 = 100000000000.35; [L39] double var_1_23 = 199.4; [L40] double var_1_24 = 63.5; [L41] signed short int var_1_25 = 1; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 0; [L44] signed short int var_1_29 = -8; [L45] signed long int last_1_var_1_8 = 16; [L46] unsigned char last_1_var_1_16 = 5; VAL [isInitial=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L171] isInitial = 1 [L172] FCALL initially() [L173] int k_loop; [L174] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L174] COND TRUE k_loop < 1 [L175] CALL updateLastVariables() [L163] last_1_var_1_8 = var_1_8 [L164] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L128] var_1_5 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_5 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L129] RET assume_abort_if_not(var_1_5 >= 190) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=64, var_1_7=-2, var_1_8=16] [L131] var_1_6 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_7=-2, var_1_8=16] [L132] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_7=-2, var_1_8=16] [L133] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L133] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L134] var_1_13 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L135] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L136] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L136] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L137] var_1_14 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L138] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L139] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L139] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L140] var_1_15 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L141] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L142] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L143] var_1_17 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_17 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L144] RET assume_abort_if_not(var_1_17 >= 95) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L145] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L145] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L146] var_1_18 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L147] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L148] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L148] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L149] var_1_19 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L150] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L151] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L151] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L152] var_1_22 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L153] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L154] var_1_23 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L155] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L156] var_1_24 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L157] RET assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L160] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L160] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L176] RET updateVariables() [L177] CALL step() [L50] COND TRUE (last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16 [L51] var_1_1 = ((var_1_5 - 2) - var_1_6) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L55] COND TRUE 100.5f < var_1_22 [L56] var_1_27 = (! var_1_28) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L58] COND TRUE var_1_27 || var_1_27 [L59] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L61] signed long int stepLocal_5 = 2; [L62] unsigned char stepLocal_4 = var_1_5; [L63] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_4=-58, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L64] COND FALSE !(stepLocal_4 <= var_1_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L67] COND TRUE stepLocal_3 || var_1_27 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=16] [L68] COND TRUE stepLocal_5 < var_1_1 [L69] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L73] COND FALSE !(! var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L80] signed long int stepLocal_2 = ~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))); VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L81] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L81] signed long int stepLocal_1 = var_1_11 >> var_1_1; [L82] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, stepLocal_1=0, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L83] COND TRUE var_1_5 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L84] COND FALSE !(var_1_1 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L94] COND TRUE (var_1_22 * -0.625) < (var_1_23 * var_1_24) [L95] var_1_21 = ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L101] COND FALSE !(var_1_7 > var_1_5) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L106] COND TRUE \read(var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L107] COND FALSE !(var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=5, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L117] COND TRUE var_1_15 > var_1_25 [L118] var_1_16 = (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L120] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L120] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=-128, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L120] signed long int stepLocal_6 = (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))); [L121] COND FALSE !(stepLocal_6 > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) [L124] var_1_20 = ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L177] RET step() [L178] CALL, EXPR property() [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L167-L168] return ((((((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16))))) && (((var_1_22 * -0.625) < (var_1_23 * var_1_24)) ? (var_1_21 == ((signed short int) ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))))) : (var_1_27 ? (var_1_21 == ((signed short int) (((((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) > ((var_1_13 + var_1_6))) ? ((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) : ((var_1_13 + var_1_6)))))) : 1))) && (var_1_27 ? ((var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) ? (var_1_27 ? (var_1_25 == ((signed short int) var_1_17)) : (var_1_25 == ((signed short int) var_1_18))) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((100.5f < var_1_22) ? (var_1_27 == ((unsigned char) (! var_1_28))) : 1)) && ((var_1_7 > var_1_5) ? (((var_1_21 <= var_1_6) || (var_1_27 || var_1_27)) ? (var_1_29 == ((signed short int) var_1_17)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=28, var_1_14=-28, var_1_15=63, var_1_16=98, var_1_17=383, var_1_18=283, var_1_19=256, var_1_1=98, var_1_20=104, var_1_21=28, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-58, var_1_6=-158, var_1_7=-2, var_1_8=98] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.5s, OverallIterations: 13, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4713 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4689 mSDsluCounter, 5595 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3731 mSDsCounter, 370 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7829 IncrementalHoareTripleChecker+Invalid, 8199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 370 mSolverCounterUnsat, 1864 mSDtfsCounter, 7829 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 929 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4764 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1170occurred in iteration=12, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 2457 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 2772 NumberOfCodeBlocks, 2772 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2590 ConstructedInterpolants, 0 QuantifiedInterpolants, 25517 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 13799/14280 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:56:14,260 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-59.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 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:56:15,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:56:16,047 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:56:16,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:56:16,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:56:16,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:56:16,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:56:16,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:56:16,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:56:16,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:56:16,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:56:16,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:56:16,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:56:16,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:56:16,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:56:16,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:56:16,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:56:16,068 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 -> 18f661507baa99a6860677d13bda352b5068a9ab896ed00822695643614eba74 [2025-01-09 12:56:16,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:56:16,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:56:16,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:56:16,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:56:16,270 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:56:16,272 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-59.i [2025-01-09 12:56:17,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab6e66058/85108e1181114249b38b5f53a0dac758/FLAG78c9af7ea [2025-01-09 12:56:17,719 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:56:17,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-01-09 12:56:17,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab6e66058/85108e1181114249b38b5f53a0dac758/FLAG78c9af7ea [2025-01-09 12:56:17,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab6e66058/85108e1181114249b38b5f53a0dac758 [2025-01-09 12:56:17,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:56:17,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:56:17,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:56:17,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:56:17,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:56:17,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:56:17" (1/1) ... [2025-01-09 12:56:17,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503394c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:17, skipping insertion in model container [2025-01-09 12:56:17,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:56:17" (1/1) ... [2025-01-09 12:56:17,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:56:17,872 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-59.i[916,929] [2025-01-09 12:56:17,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:56:17,951 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:56:17,959 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-59.i[916,929] [2025-01-09 12:56:18,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:56:18,018 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:56:18,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18 WrapperNode [2025-01-09 12:56:18,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:56:18,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:56:18,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:56:18,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:56:18,026 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:56:18" (1/1) ... [2025-01-09 12:56:18,034 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:56:18" (1/1) ... [2025-01-09 12:56:18,063 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 12:56:18,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:56:18,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:56:18,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:56:18,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:56:18,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,094 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:56:18,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:56:18,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:56:18,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:56:18,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:56:18,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (1/1) ... [2025-01-09 12:56:18,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:56:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:56:18,152 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:56:18,158 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:56:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:56:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:56:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:56:18,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:56:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:56:18,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:56:18,245 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:56:18,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:56:27,531 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 12:56:27,531 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:56:27,541 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:56:27,541 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:56:27,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:56:27 BoogieIcfgContainer [2025-01-09 12:56:27,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:56:27,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:56:27,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:56:27,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:56:27,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:56:17" (1/3) ... [2025-01-09 12:56:27,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acd8557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:56:27, skipping insertion in model container [2025-01-09 12:56:27,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:56:18" (2/3) ... [2025-01-09 12:56:27,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acd8557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:56:27, skipping insertion in model container [2025-01-09 12:56:27,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:56:27" (3/3) ... [2025-01-09 12:56:27,549 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i [2025-01-09 12:56:27,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:56:27,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-59.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:56:27,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:56:27,606 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;@64305113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:56:27,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:56:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:56:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:56:27,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:27,622 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:27,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:27,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1783395915, now seen corresponding path program 1 times [2025-01-09 12:56:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:56:27,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056261655] [2025-01-09 12:56:27,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:27,645 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:56:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:56:27,652 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:56:27,667 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:56:27,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:56:27,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:56:27,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:27,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:27,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:56:28,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-01-09 12:56:28,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:56:28,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:56:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056261655] [2025-01-09 12:56:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056261655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:56:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:56:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:56:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368331131] [2025-01-09 12:56:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:56:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:56:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:56:28,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:56:28,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:56:28,055 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:56:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:56:28,070 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2025-01-09 12:56:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:56:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2025-01-09 12:56:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:56:28,074 INFO L225 Difference]: With dead ends: 145 [2025-01-09 12:56:28,074 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 12:56:28,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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:56:28,078 INFO L435 NwaCegarLoop]: 114 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, 114 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:56:28,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:56:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 12:56:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 12:56:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 12:56:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2025-01-09 12:56:28,108 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 140 [2025-01-09 12:56:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:56:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2025-01-09 12:56:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 12:56:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2025-01-09 12:56:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:56:28,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:28,114 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:28,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:56:28,314 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:56:28,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:28,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1337791493, now seen corresponding path program 1 times [2025-01-09 12:56:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:56:28,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852530344] [2025-01-09 12:56:28,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:28,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:56:28,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:56:28,321 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:56:28,322 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:56:28,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:56:28,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:56:28,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:28,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:28,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:56:28,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:56:29,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:56:29,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:56:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852530344] [2025-01-09 12:56:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852530344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:56:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:56:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:56:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199099446] [2025-01-09 12:56:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:56:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:56:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:56:29,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:56:29,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:56:29,379 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:31,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:56:35,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:56:39,943 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:56:41,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:56:45,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:56:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:56:46,444 INFO L93 Difference]: Finished difference Result 230 states and 364 transitions. [2025-01-09 12:56:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:56:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-01-09 12:56:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:56:46,492 INFO L225 Difference]: With dead ends: 230 [2025-01-09 12:56:46,492 INFO L226 Difference]: Without dead ends: 162 [2025-01-09 12:56:46,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:56:46,493 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 113 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:56:46,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 345 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 17.0s Time] [2025-01-09 12:56:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-09 12:56:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 137. [2025-01-09 12:56:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:56:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2025-01-09 12:56:46,531 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 140 [2025-01-09 12:56:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:56:46,535 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2025-01-09 12:56:46,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2025-01-09 12:56:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:56:46,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:46,538 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:46,551 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:56:46,738 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:56:46,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 656353213, now seen corresponding path program 1 times [2025-01-09 12:56:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:56:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776710229] [2025-01-09 12:56:46,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:46,741 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:56:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:56:46,743 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:56:46,743 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:56:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:56:47,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:56:47,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:47,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:47,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:56:47,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 12:56:47,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:56:47,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:56:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776710229] [2025-01-09 12:56:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776710229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:56:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:56:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:56:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402241355] [2025-01-09 12:56:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:56:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:56:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:56:47,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:56:47,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:56:47,080 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:49,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 12:56:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:56:49,771 INFO L93 Difference]: Finished difference Result 271 states and 431 transitions. [2025-01-09 12:56:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:56:49,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-01-09 12:56:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:56:49,798 INFO L225 Difference]: With dead ends: 271 [2025-01-09 12:56:49,798 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 12:56:49,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:56:49,799 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:56:49,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 12:56:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 12:56:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 12:56:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:56:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 215 transitions. [2025-01-09 12:56:49,827 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 215 transitions. Word has length 140 [2025-01-09 12:56:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:56:49,827 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 215 transitions. [2025-01-09 12:56:49,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 215 transitions. [2025-01-09 12:56:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:56:49,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:49,829 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:49,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:56:50,029 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:56:50,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:50,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 940913176, now seen corresponding path program 1 times [2025-01-09 12:56:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:56:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283768003] [2025-01-09 12:56:50,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:50,031 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:56:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:56:50,039 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:56:50,041 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:56:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:56:50,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:56:50,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:50,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:50,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:56:50,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 12:56:50,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:56:50,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:56:50,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283768003] [2025-01-09 12:56:50,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283768003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:56:50,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:56:50,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:56:50,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903135152] [2025-01-09 12:56:50,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:56:50,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:56:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:56:50,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:56:50,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:56:50,563 INFO L87 Difference]: Start difference. First operand 137 states and 215 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:53,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:56:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:56:53,799 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2025-01-09 12:56:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:56:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2025-01-09 12:56:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:56:53,827 INFO L225 Difference]: With dead ends: 285 [2025-01-09 12:56:53,827 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 12:56:53,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:56:53,829 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 112 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:56:53,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 163 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 12:56:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 12:56:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-01-09 12:56:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 12:56:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2025-01-09 12:56:53,859 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 141 [2025-01-09 12:56:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:56:53,859 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2025-01-09 12:56:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 12:56:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2025-01-09 12:56:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 12:56:53,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:56:53,863 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:56:53,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 12:56:54,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:56:54,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:56:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:56:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash -21365686, now seen corresponding path program 1 times [2025-01-09 12:56:54,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:56:54,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816116101] [2025-01-09 12:56:54,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:54,065 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:56:54,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:56:54,071 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:54,077 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 (6)] Waiting until timeout for monitored process [2025-01-09 12:56:54,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:56:54,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:56:54,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:54,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:54,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 12:56:54,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-01-09 12:56:55,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:56:56,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:56:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816116101] [2025-01-09 12:56:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816116101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:56:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722988603] [2025-01-09 12:56:56,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:56:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:56:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:56:56,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:56:56,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-01-09 12:56:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 12:56:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 12:56:56,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:56:56,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:56:56,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 12:56:56,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:56:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-09 12:56:58,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:56:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [722988603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:56:59,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:56:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2025-01-09 12:56:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027082862] [2025-01-09 12:56:59,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:56:59,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:56:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:56:59,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:56:59,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:56:59,357 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2025-01-09 12:57:05,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]