./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.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-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:58:20,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:58:20,120 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:58:20,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:58:20,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:58:20,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:58:20,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:58:20,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:58:20,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:58:20,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:58:20,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:58:20,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:58:20,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:58:20,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:58:20,145 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:58:20,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:58:20,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:58:20,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:58:20,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:58:20,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:58:20,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:58:20,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:58:20,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:58:20,150 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-01-09 12:58:20,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:58:20,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:58:20,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:58:20,383 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:58:20,383 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:58:20,385 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-77.i [2025-01-09 12:58:21,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77405478e/fc29aef3e5f446d595ab0e2d40dc9e31/FLAG2e66a36e1 [2025-01-09 12:58:21,789 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:58:21,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-01-09 12:58:21,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77405478e/fc29aef3e5f446d595ab0e2d40dc9e31/FLAG2e66a36e1 [2025-01-09 12:58:22,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77405478e/fc29aef3e5f446d595ab0e2d40dc9e31 [2025-01-09 12:58:22,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:58:22,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:58:22,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:58:22,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:58:22,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:58:22,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608424ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22, skipping insertion in model container [2025-01-09 12:58:22,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:58:22,220 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-77.i[916,929] [2025-01-09 12:58:22,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:58:22,277 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:58:22,288 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-77.i[916,929] [2025-01-09 12:58:22,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:58:22,324 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:58:22,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22 WrapperNode [2025-01-09 12:58:22,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:58:22,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:58:22,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:58:22,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:58:22,333 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:58:22" (1/1) ... [2025-01-09 12:58:22,343 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:58:22" (1/1) ... [2025-01-09 12:58:22,360 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-01-09 12:58:22,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:58:22,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:58:22,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:58:22,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:58:22,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,385 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:58:22,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:58:22,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:58:22,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:58:22,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:58:22,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (1/1) ... [2025-01-09 12:58:22,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:58:22,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:22,431 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:58:22,433 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:58:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:58:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:58:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:58:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:58:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:58:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:58:22,530 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:58:22,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:58:22,781 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 12:58:22,781 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:58:22,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:58:22,790 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:58:22,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:58:22 BoogieIcfgContainer [2025-01-09 12:58:22,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:58:22,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:58:22,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:58:22,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:58:22,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:58:22" (1/3) ... [2025-01-09 12:58:22,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ae1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:58:22, skipping insertion in model container [2025-01-09 12:58:22,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:58:22" (2/3) ... [2025-01-09 12:58:22,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121ae1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:58:22, skipping insertion in model container [2025-01-09 12:58:22,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:58:22" (3/3) ... [2025-01-09 12:58:22,798 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-01-09 12:58:22,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:58:22,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:58:22,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:58:22,872 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;@48965460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:58:22,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:58:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:58:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:58:22,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:22,884 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1592543056, now seen corresponding path program 1 times [2025-01-09 12:58:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-01-09 12:58:22,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:22,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:58:23,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:58:23,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:23,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996826658] [2025-01-09 12:58:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996826658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:23,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:58:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583714935] [2025-01-09 12:58:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:23,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:58:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:23,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:58:23,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:58:23,442 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:23,627 INFO L93 Difference]: Finished difference Result 243 states and 428 transitions. [2025-01-09 12:58:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:58:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-01-09 12:58:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:23,641 INFO L225 Difference]: With dead ends: 243 [2025-01-09 12:58:23,641 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 12:58:23,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:58:23,647 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 69 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:23,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 286 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:23,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 12:58:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-01-09 12:58:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 12:58:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2025-01-09 12:58:23,708 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 168 [2025-01-09 12:58:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:23,708 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2025-01-09 12:58:23,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2025-01-09 12:58:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:23,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:23,715 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:23,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 12:58:23,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1791413403, now seen corresponding path program 1 times [2025-01-09 12:58:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903930728] [2025-01-09 12:58:23,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:23,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903930728] [2025-01-09 12:58:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903930728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:58:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007021220] [2025-01-09 12:58:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:23,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:58:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:23,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:58:23,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:58:23,978 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:24,182 INFO L93 Difference]: Finished difference Result 529 states and 825 transitions. [2025-01-09 12:58:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:58:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-01-09 12:58:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:24,186 INFO L225 Difference]: With dead ends: 529 [2025-01-09 12:58:24,186 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 12:58:24,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:58:24,188 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 179 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 453 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 12:58:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 303. [2025-01-09 12:58:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 198 states have internal predecessors, (272), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 12:58:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 472 transitions. [2025-01-09 12:58:24,249 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 472 transitions. Word has length 169 [2025-01-09 12:58:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:24,250 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 472 transitions. [2025-01-09 12:58:24,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 472 transitions. [2025-01-09 12:58:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:24,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:24,254 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:24,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:58:24,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:24,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 973764953, now seen corresponding path program 1 times [2025-01-09 12:58:24,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:24,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733425222] [2025-01-09 12:58:24,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:24,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:24,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:25,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733425222] [2025-01-09 12:58:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733425222] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:25,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850331175] [2025-01-09 12:58:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:25,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:25,064 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:58:25,066 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:58:25,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:25,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:25,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:25,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:25,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 12:58:25,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 12:58:26,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850331175] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:58:26,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:58:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 26 [2025-01-09 12:58:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119553220] [2025-01-09 12:58:26,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:26,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 12:58:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 12:58:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:58:26,903 INFO L87 Difference]: Start difference. First operand 303 states and 472 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-01-09 12:58:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:28,033 INFO L93 Difference]: Finished difference Result 903 states and 1380 transitions. [2025-01-09 12:58:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 12:58:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 169 [2025-01-09 12:58:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:28,038 INFO L225 Difference]: With dead ends: 903 [2025-01-09 12:58:28,038 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 12:58:28,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1254, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 12:58:28,044 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 715 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:28,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 831 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:58:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 12:58:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 458. [2025-01-09 12:58:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 308 states have (on average 1.3474025974025974) internal successors, (415), 310 states have internal predecessors, (415), 141 states have call successors, (141), 8 states have call predecessors, (141), 8 states have return successors, (141), 139 states have call predecessors, (141), 141 states have call successors, (141) [2025-01-09 12:58:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 697 transitions. [2025-01-09 12:58:28,107 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 697 transitions. Word has length 169 [2025-01-09 12:58:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 697 transitions. [2025-01-09 12:58:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-01-09 12:58:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 697 transitions. [2025-01-09 12:58:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:28,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:28,109 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:58:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:28,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:28,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:28,311 INFO L85 PathProgramCache]: Analyzing trace with hash 580737943, now seen corresponding path program 1 times [2025-01-09 12:58:28,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:28,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-01-09 12:58:28,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:28,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:28,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:28,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:28,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796618604] [2025-01-09 12:58:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796618604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:58:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856900250] [2025-01-09 12:58:28,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:28,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:58:28,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:28,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:58:28,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:58:28,503 INFO L87 Difference]: Start difference. First operand 458 states and 697 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:28,639 INFO L93 Difference]: Finished difference Result 1223 states and 1809 transitions. [2025-01-09 12:58:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:58:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-01-09 12:58:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:28,645 INFO L225 Difference]: With dead ends: 1223 [2025-01-09 12:58:28,645 INFO L226 Difference]: Without dead ends: 844 [2025-01-09 12:58:28,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:58:28,647 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 97 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 351 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-01-09 12:58:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 611. [2025-01-09 12:58:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 442 states have (on average 1.3506787330316743) internal successors, (597), 446 states have internal predecessors, (597), 157 states have call successors, (157), 11 states have call predecessors, (157), 11 states have return successors, (157), 153 states have call predecessors, (157), 157 states have call successors, (157) [2025-01-09 12:58:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 911 transitions. [2025-01-09 12:58:28,702 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 911 transitions. Word has length 169 [2025-01-09 12:58:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:28,702 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 911 transitions. [2025-01-09 12:58:28,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 911 transitions. [2025-01-09 12:58:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:28,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:28,704 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:58:28,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:28,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -6068071, now seen corresponding path program 1 times [2025-01-09 12:58:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582802513] [2025-01-09 12:58:28,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:28,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:28,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:28,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582802513] [2025-01-09 12:58:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582802513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:58:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883709584] [2025-01-09 12:58:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:58:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:28,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:58:28,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:58:28,757 INFO L87 Difference]: Start difference. First operand 611 states and 911 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:28,825 INFO L93 Difference]: Finished difference Result 1402 states and 2100 transitions. [2025-01-09 12:58:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:58:28,826 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-01-09 12:58:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:28,833 INFO L225 Difference]: With dead ends: 1402 [2025-01-09 12:58:28,833 INFO L226 Difference]: Without dead ends: 890 [2025-01-09 12:58:28,837 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:58:28,838 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 115 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:28,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 246 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:58:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-01-09 12:58:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 877. [2025-01-09 12:58:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 600 states have (on average 1.315) internal successors, (789), 604 states have internal predecessors, (789), 257 states have call successors, (257), 19 states have call predecessors, (257), 19 states have return successors, (257), 253 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 12:58:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1303 transitions. [2025-01-09 12:58:28,922 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1303 transitions. Word has length 169 [2025-01-09 12:58:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:28,923 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1303 transitions. [2025-01-09 12:58:28,923 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1303 transitions. [2025-01-09 12:58:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:28,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:28,926 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:58:28,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:28,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1180499360, now seen corresponding path program 1 times [2025-01-09 12:58:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928771181] [2025-01-09 12:58:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:28,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928771181] [2025-01-09 12:58:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928771181] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031233670] [2025-01-09 12:58:29,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:29,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:29,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:29,385 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:58:29,387 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:58:29,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:29,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:29,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:29,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:29,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 12:58:29,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 726 proven. 45 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-01-09 12:58:30,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031233670] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:58:30,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:58:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-01-09 12:58:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803311275] [2025-01-09 12:58:30,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 12:58:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 12:58:30,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-01-09 12:58:30,680 INFO L87 Difference]: Start difference. First operand 877 states and 1303 transitions. Second operand has 32 states, 32 states have (on average 4.21875) internal successors, (135), 32 states have internal predecessors, (135), 9 states have call successors, (75), 4 states have call predecessors, (75), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2025-01-09 12:58:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:32,029 INFO L93 Difference]: Finished difference Result 1752 states and 2560 transitions. [2025-01-09 12:58:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 12:58:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.21875) internal successors, (135), 32 states have internal predecessors, (135), 9 states have call successors, (75), 4 states have call predecessors, (75), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) Word has length 169 [2025-01-09 12:58:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:32,037 INFO L225 Difference]: With dead ends: 1752 [2025-01-09 12:58:32,037 INFO L226 Difference]: Without dead ends: 1356 [2025-01-09 12:58:32,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=506, Invalid=2356, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 12:58:32,040 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 927 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:32,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 970 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:58:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-01-09 12:58:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 935. [2025-01-09 12:58:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 657 states have (on average 1.3318112633181127) internal successors, (875), 661 states have internal predecessors, (875), 257 states have call successors, (257), 20 states have call predecessors, (257), 20 states have return successors, (257), 253 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 12:58:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1389 transitions. [2025-01-09 12:58:32,114 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1389 transitions. Word has length 169 [2025-01-09 12:58:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:32,115 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1389 transitions. [2025-01-09 12:58:32,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.21875) internal successors, (135), 32 states have internal predecessors, (135), 9 states have call successors, (75), 4 states have call predecessors, (75), 7 states have return successors, (75), 9 states have call predecessors, (75), 9 states have call successors, (75) [2025-01-09 12:58:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1389 transitions. [2025-01-09 12:58:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:32,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:32,116 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,124 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:58:32,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:32,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:32,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1573526370, now seen corresponding path program 1 times [2025-01-09 12:58:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889247277] [2025-01-09 12:58:32,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:32,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:32,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:32,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:32,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:32,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:32,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889247277] [2025-01-09 12:58:32,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889247277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:32,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:32,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:58:32,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475116956] [2025-01-09 12:58:32,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:32,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:58:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:58:32,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:58:32,507 INFO L87 Difference]: Start difference. First operand 935 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:32,620 INFO L93 Difference]: Finished difference Result 1344 states and 1997 transitions. [2025-01-09 12:58:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:58:32,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-01-09 12:58:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:32,627 INFO L225 Difference]: With dead ends: 1344 [2025-01-09 12:58:32,627 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 12:58:32,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:58:32,629 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 163 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:32,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 326 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:32,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 12:58:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 930. [2025-01-09 12:58:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 652 states have (on average 1.3312883435582823) internal successors, (868), 656 states have internal predecessors, (868), 257 states have call successors, (257), 20 states have call predecessors, (257), 20 states have return successors, (257), 253 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 12:58:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1382 transitions. [2025-01-09 12:58:32,695 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1382 transitions. Word has length 169 [2025-01-09 12:58:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:32,696 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1382 transitions. [2025-01-09 12:58:32,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1382 transitions. [2025-01-09 12:58:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 12:58:32,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:32,697 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:58:32,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:32,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash -923767397, now seen corresponding path program 1 times [2025-01-09 12:58:32,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:32,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864783503] [2025-01-09 12:58:32,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:32,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:32,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:32,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:32,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:32,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864783503] [2025-01-09 12:58:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864783503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749248406] [2025-01-09 12:58:32,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:32,945 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:58:32,947 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:58:33,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 12:58:33,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 12:58:33,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:33,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:33,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:58:33,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 12:58:33,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 12:58:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749248406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:58:33,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:58:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 12:58:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261152902] [2025-01-09 12:58:33,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:58:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:33,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:58:33,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:58:33,391 INFO L87 Difference]: Start difference. First operand 930 states and 1382 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 12:58:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:33,562 INFO L93 Difference]: Finished difference Result 1292 states and 1909 transitions. [2025-01-09 12:58:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:58:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 169 [2025-01-09 12:58:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:33,565 INFO L225 Difference]: With dead ends: 1292 [2025-01-09 12:58:33,566 INFO L226 Difference]: Without dead ends: 510 [2025-01-09 12:58:33,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 335 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:58:33,568 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 97 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:33,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 208 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-01-09 12:58:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 420. [2025-01-09 12:58:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 278 states have (on average 1.276978417266187) internal successors, (355), 278 states have internal predecessors, (355), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-01-09 12:58:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 605 transitions. [2025-01-09 12:58:33,603 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 605 transitions. Word has length 169 [2025-01-09 12:58:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:33,603 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 605 transitions. [2025-01-09 12:58:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 12:58:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 605 transitions. [2025-01-09 12:58:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:33,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:33,605 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:33,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:58:33,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:33,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1548562932, now seen corresponding path program 1 times [2025-01-09 12:58:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244207232] [2025-01-09 12:58:33,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:33,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:33,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:33,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244207232] [2025-01-09 12:58:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244207232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:33,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:33,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:58:33,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808702674] [2025-01-09 12:58:33,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:33,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:58:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:33,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:58:33,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:58:33,909 INFO L87 Difference]: Start difference. First operand 420 states and 605 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:34,127 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2025-01-09 12:58:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:58:34,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:34,130 INFO L225 Difference]: With dead ends: 916 [2025-01-09 12:58:34,130 INFO L226 Difference]: Without dead ends: 584 [2025-01-09 12:58:34,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:58:34,131 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 443 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:34,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 503 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-09 12:58:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 446. [2025-01-09 12:58:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 304 states have (on average 1.3026315789473684) internal successors, (396), 304 states have internal predecessors, (396), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-01-09 12:58:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2025-01-09 12:58:34,170 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 170 [2025-01-09 12:58:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2025-01-09 12:58:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2025-01-09 12:58:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:34,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:34,172 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:34,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:58:34,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 868504562, now seen corresponding path program 1 times [2025-01-09 12:58:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212109126] [2025-01-09 12:58:34,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:34,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:34,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:34,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:34,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650981084] [2025-01-09 12:58:34,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:34,232 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:58:34,234 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:58:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:34,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:34,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:34,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:34,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:58:34,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:34,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:58:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212109126] [2025-01-09 12:58:34,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650981084] [2025-01-09 12:58:34,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650981084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:34,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:34,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:58:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910248565] [2025-01-09 12:58:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:58:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:34,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:58:34,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:58:34,776 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:35,154 INFO L93 Difference]: Finished difference Result 722 states and 1047 transitions. [2025-01-09 12:58:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:58:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:35,158 INFO L225 Difference]: With dead ends: 722 [2025-01-09 12:58:35,158 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 12:58:35,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:58:35,159 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 161 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:35,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 756 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:58:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 12:58:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 450. [2025-01-09 12:58:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 308 states have (on average 1.301948051948052) internal successors, (401), 308 states have internal predecessors, (401), 125 states have call successors, (125), 16 states have call predecessors, (125), 16 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-01-09 12:58:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 651 transitions. [2025-01-09 12:58:35,218 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 651 transitions. Word has length 170 [2025-01-09 12:58:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:35,219 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 651 transitions. [2025-01-09 12:58:35,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 651 transitions. [2025-01-09 12:58:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:35,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:35,220 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:35,227 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:58:35,420 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,SelfDestructingSolverStorable9 [2025-01-09 12:58:35,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:35,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash -478062451, now seen corresponding path program 1 times [2025-01-09 12:58:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404534006] [2025-01-09 12:58:35,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:35,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:35,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:35,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:35,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373896323] [2025-01-09 12:58:35,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:35,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:35,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:35,469 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:58:35,471 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:58:35,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:35,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:35,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:35,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:35,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 12:58:35,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:36,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:58:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404534006] [2025-01-09 12:58:36,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373896323] [2025-01-09 12:58:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373896323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:58:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763904195] [2025-01-09 12:58:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:58:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:58:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:58:36,171 INFO L87 Difference]: Start difference. First operand 450 states and 651 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:36,623 INFO L93 Difference]: Finished difference Result 822 states and 1170 transitions. [2025-01-09 12:58:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:58:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:36,627 INFO L225 Difference]: With dead ends: 822 [2025-01-09 12:58:36,627 INFO L226 Difference]: Without dead ends: 729 [2025-01-09 12:58:36,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:58:36,628 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 390 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:36,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1031 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:58:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-09 12:58:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 651. [2025-01-09 12:58:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 449 states have (on average 1.2828507795100224) internal successors, (576), 451 states have internal predecessors, (576), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 928 transitions. [2025-01-09 12:58:36,685 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 928 transitions. Word has length 170 [2025-01-09 12:58:36,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:36,686 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 928 transitions. [2025-01-09 12:58:36,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 928 transitions. [2025-01-09 12:58:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:36,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:36,688 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:36,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 12:58:36,888 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,SelfDestructingSolverStorable10 [2025-01-09 12:58:36,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2141429648, now seen corresponding path program 1 times [2025-01-09 12:58:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011307137] [2025-01-09 12:58:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:36,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:36,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:36,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:36,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:37,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011307137] [2025-01-09 12:58:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011307137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:58:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291213412] [2025-01-09 12:58:37,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:58:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:37,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:58:37,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:58:37,028 INFO L87 Difference]: Start difference. First operand 651 states and 928 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:37,264 INFO L93 Difference]: Finished difference Result 1116 states and 1601 transitions. [2025-01-09 12:58:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:58:37,264 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:37,268 INFO L225 Difference]: With dead ends: 1116 [2025-01-09 12:58:37,269 INFO L226 Difference]: Without dead ends: 754 [2025-01-09 12:58:37,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:58:37,270 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 155 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:37,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 428 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-01-09 12:58:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 665. [2025-01-09 12:58:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 463 states have (on average 1.2915766738660908) internal successors, (598), 465 states have internal predecessors, (598), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 950 transitions. [2025-01-09 12:58:37,343 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 950 transitions. Word has length 170 [2025-01-09 12:58:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:37,343 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 950 transitions. [2025-01-09 12:58:37,343 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 950 transitions. [2025-01-09 12:58:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:37,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:37,344 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:37,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:58:37,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1473479278, now seen corresponding path program 1 times [2025-01-09 12:58:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529511050] [2025-01-09 12:58:37,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:37,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:37,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:37,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:37,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529511050] [2025-01-09 12:58:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529511050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:58:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179716904] [2025-01-09 12:58:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:58:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:37,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:58:37,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:58:37,677 INFO L87 Difference]: Start difference. First operand 665 states and 950 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:37,892 INFO L93 Difference]: Finished difference Result 1779 states and 2476 transitions. [2025-01-09 12:58:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:58:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:37,898 INFO L225 Difference]: With dead ends: 1779 [2025-01-09 12:58:37,899 INFO L226 Difference]: Without dead ends: 1235 [2025-01-09 12:58:37,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:58:37,901 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 144 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:37,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 383 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-01-09 12:58:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 761. [2025-01-09 12:58:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 559 states have (on average 1.2915921288014311) internal successors, (722), 561 states have internal predecessors, (722), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1074 transitions. [2025-01-09 12:58:37,973 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1074 transitions. Word has length 170 [2025-01-09 12:58:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:37,973 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1074 transitions. [2025-01-09 12:58:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1074 transitions. [2025-01-09 12:58:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:37,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:37,975 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:37,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:58:37,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:37,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1046480656, now seen corresponding path program 1 times [2025-01-09 12:58:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:37,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924918249] [2025-01-09 12:58:37,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:37,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:38,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:38,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:38,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765949278] [2025-01-09 12:58:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:38,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:38,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:38,020 INFO L229 MonitoredProcess]: Starting monitored process 7 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:58:38,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 12:58:38,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:38,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:38,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:38,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:38,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 12:58:38,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 582 proven. 45 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-01-09 12:58:39,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924918249] [2025-01-09 12:58:46,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765949278] [2025-01-09 12:58:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765949278] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:46,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:58:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 12:58:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833836363] [2025-01-09 12:58:46,973 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:58:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:58:46,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=259, Unknown=1, NotChecked=0, Total=306 [2025-01-09 12:58:46,974 INFO L87 Difference]: Start difference. First operand 761 states and 1074 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 12:58:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:47,937 INFO L93 Difference]: Finished difference Result 1566 states and 2209 transitions. [2025-01-09 12:58:47,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:58:47,938 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-01-09 12:58:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:47,943 INFO L225 Difference]: With dead ends: 1566 [2025-01-09 12:58:47,944 INFO L226 Difference]: Without dead ends: 1124 [2025-01-09 12:58:47,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=181, Invalid=810, Unknown=1, NotChecked=0, Total=992 [2025-01-09 12:58:47,946 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 380 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:47,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 931 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:58:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-01-09 12:58:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 806. [2025-01-09 12:58:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 604 states have (on average 1.3062913907284768) internal successors, (789), 606 states have internal predecessors, (789), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1141 transitions. [2025-01-09 12:58:48,014 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1141 transitions. Word has length 170 [2025-01-09 12:58:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:48,014 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1141 transitions. [2025-01-09 12:58:48,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 12:58:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1141 transitions. [2025-01-09 12:58:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:48,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:48,016 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:48,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 12:58:48,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 12:58:48,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2120423440, now seen corresponding path program 1 times [2025-01-09 12:58:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:48,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384247425] [2025-01-09 12:58:48,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:48,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:48,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:48,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:48,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:48,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:48,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126478186] [2025-01-09 12:58:48,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:48,276 INFO L229 MonitoredProcess]: Starting monitored process 8 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:58:48,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 12:58:48,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:48,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:58:48,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:48,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:58:48,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384247425] [2025-01-09 12:58:48,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126478186] [2025-01-09 12:58:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126478186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:58:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76172523] [2025-01-09 12:58:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:58:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:58:48,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:58:48,585 INFO L87 Difference]: Start difference. First operand 806 states and 1141 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:48,774 INFO L93 Difference]: Finished difference Result 1262 states and 1802 transitions. [2025-01-09 12:58:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:58:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:48,778 INFO L225 Difference]: With dead ends: 1262 [2025-01-09 12:58:48,778 INFO L226 Difference]: Without dead ends: 820 [2025-01-09 12:58:48,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:58:48,780 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 122 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:48,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 527 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-01-09 12:58:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 734. [2025-01-09 12:58:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 532 states have (on average 1.2838345864661653) internal successors, (683), 534 states have internal predecessors, (683), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1035 transitions. [2025-01-09 12:58:48,840 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1035 transitions. Word has length 170 [2025-01-09 12:58:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1035 transitions. [2025-01-09 12:58:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1035 transitions. [2025-01-09 12:58:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:48,842 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:48,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 12:58:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:49,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 126912265, now seen corresponding path program 1 times [2025-01-09 12:58:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-01-09 12:58:49,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:49,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:49,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:49,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:49,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:49,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-01-09 12:58:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197066247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:49,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:58:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91838099] [2025-01-09 12:58:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:58:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:49,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:58:49,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:58:49,388 INFO L87 Difference]: Start difference. First operand 734 states and 1035 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:49,632 INFO L93 Difference]: Finished difference Result 1417 states and 1956 transitions. [2025-01-09 12:58:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:58:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:49,639 INFO L225 Difference]: With dead ends: 1417 [2025-01-09 12:58:49,639 INFO L226 Difference]: Without dead ends: 1207 [2025-01-09 12:58:49,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:58:49,640 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 117 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:49,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 441 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:58:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-01-09 12:58:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 734. [2025-01-09 12:58:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 532 states have (on average 1.2838345864661653) internal successors, (683), 534 states have internal predecessors, (683), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1035 transitions. [2025-01-09 12:58:49,710 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1035 transitions. Word has length 170 [2025-01-09 12:58:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:49,710 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1035 transitions. [2025-01-09 12:58:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1035 transitions. [2025-01-09 12:58:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:49,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:49,712 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:58:49,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:49,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1901919627, now seen corresponding path program 1 times [2025-01-09 12:58:49,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083979520] [2025-01-09 12:58:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:49,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:49,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:49,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877851970] [2025-01-09 12:58:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:49,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:49,760 INFO L229 MonitoredProcess]: Starting monitored process 9 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:58:49,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 12:58:49,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:49,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:49,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:49,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 12:58:49,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 726 proven. 45 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-01-09 12:58:51,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083979520] [2025-01-09 12:58:51,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877851970] [2025-01-09 12:58:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877851970] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:51,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:58:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-01-09 12:58:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250230722] [2025-01-09 12:58:51,589 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:58:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:58:51,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:58:51,592 INFO L87 Difference]: Start difference. First operand 734 states and 1035 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 12:58:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:53,000 INFO L93 Difference]: Finished difference Result 1494 states and 2092 transitions. [2025-01-09 12:58:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 12:58:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 170 [2025-01-09 12:58:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:53,007 INFO L225 Difference]: With dead ends: 1494 [2025-01-09 12:58:53,007 INFO L226 Difference]: Without dead ends: 1284 [2025-01-09 12:58:53,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1417, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 12:58:53,009 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 539 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:53,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1532 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:58:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-01-09 12:58:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 771. [2025-01-09 12:58:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 569 states have (on average 1.29701230228471) internal successors, (738), 571 states have internal predecessors, (738), 176 states have call successors, (176), 25 states have call predecessors, (176), 25 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-01-09 12:58:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1090 transitions. [2025-01-09 12:58:53,093 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1090 transitions. Word has length 170 [2025-01-09 12:58:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1090 transitions. [2025-01-09 12:58:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 3 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-01-09 12:58:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1090 transitions. [2025-01-09 12:58:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 12:58:53,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:53,094 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:53,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 12:58:53,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 12:58:53,299 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 827976843, now seen corresponding path program 1 times [2025-01-09 12:58:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:53,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730865336] [2025-01-09 12:58:53,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84820557] [2025-01-09 12:58:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:53,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:53,352 INFO L229 MonitoredProcess]: Starting monitored process 10 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:58:53,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 12:58:53,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 12:58:53,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 12:58:53,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:53,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:58:53,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:58:53,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:58:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730865336] [2025-01-09 12:58:53,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84820557] [2025-01-09 12:58:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84820557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:58:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:58:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:58:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538949286] [2025-01-09 12:58:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:58:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:58:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:53,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:58:53,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:58:53,779 INFO L87 Difference]: Start difference. First operand 771 states and 1090 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:54,278 INFO L93 Difference]: Finished difference Result 1648 states and 2372 transitions. [2025-01-09 12:58:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:58:54,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-01-09 12:58:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:54,284 INFO L225 Difference]: With dead ends: 1648 [2025-01-09 12:58:54,284 INFO L226 Difference]: Without dead ends: 1438 [2025-01-09 12:58:54,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:58:54,285 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 284 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:54,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 929 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:58:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-01-09 12:58:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1006. [2025-01-09 12:58:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 748 states have (on average 1.3235294117647058) internal successors, (990), 750 states have internal predecessors, (990), 226 states have call successors, (226), 31 states have call predecessors, (226), 31 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 12:58:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1442 transitions. [2025-01-09 12:58:54,377 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1442 transitions. Word has length 170 [2025-01-09 12:58:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:54,378 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1442 transitions. [2025-01-09 12:58:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:58:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1442 transitions. [2025-01-09 12:58:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:58:54,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:54,379 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:54,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 12:58:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 12:58:54,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1209186555, now seen corresponding path program 1 times [2025-01-09 12:58:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871004540] [2025-01-09 12:58:54,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:54,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:54,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:58:54,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:58:54,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2095110404] [2025-01-09 12:58:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:54,612 INFO L229 MonitoredProcess]: Starting monitored process 11 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:58:54,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 12:58:54,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:58:54,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:58:54,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:54,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:58:54,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 12:58:54,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:58:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-01-09 12:58:55,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:58:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:58:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871004540] [2025-01-09 12:58:55,128 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:58:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095110404] [2025-01-09 12:58:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095110404] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:58:55,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:58:55,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-01-09 12:58:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090553952] [2025-01-09 12:58:55,128 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 12:58:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:58:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:58:55,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:58:55,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:58:55,129 INFO L87 Difference]: Start difference. First operand 1006 states and 1442 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 12:58:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:58:55,516 INFO L93 Difference]: Finished difference Result 1761 states and 2493 transitions. [2025-01-09 12:58:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:58:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2025-01-09 12:58:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:58:55,524 INFO L225 Difference]: With dead ends: 1761 [2025-01-09 12:58:55,524 INFO L226 Difference]: Without dead ends: 1195 [2025-01-09 12:58:55,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:58:55,526 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 209 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:58:55,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 623 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:58:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-01-09 12:58:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1010. [2025-01-09 12:58:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 751 states have (on average 1.3169107856191744) internal successors, (989), 753 states have internal predecessors, (989), 226 states have call successors, (226), 32 states have call predecessors, (226), 32 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 12:58:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1441 transitions. [2025-01-09 12:58:55,620 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1441 transitions. Word has length 171 [2025-01-09 12:58:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:58:55,621 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1441 transitions. [2025-01-09 12:58:55,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 12:58:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1441 transitions. [2025-01-09 12:58:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 12:58:55,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:58:55,622 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 12:58:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:55,823 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:58:55,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:58:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -479757187, now seen corresponding path program 1 times [2025-01-09 12:58:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:58:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017062236] [2025-01-09 12:58:55,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:58:55,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:58:55,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:58:55,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:55,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:58:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805457139] [2025-01-09 12:58:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:58:55,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:58:55,866 INFO L229 MonitoredProcess]: Starting monitored process 12 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:58:55,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 12:58:55,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:58:56,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:58:56,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:56,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:58:56,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:58:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 12:58:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 12:58:56,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:58:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:58:56,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:58:56,117 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:58:56,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:58:56,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 12:58:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:58:56,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:58:56,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:58:56,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:58:56 BoogieIcfgContainer [2025-01-09 12:58:56,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:58:56,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:58:56,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:58:56,427 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:58:56,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:58:22" (3/4) ... [2025-01-09 12:58:56,430 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:58:56,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:58:56,431 INFO L158 Benchmark]: Toolchain (without parser) took 34323.68ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 113.1MB in the beginning and 644.4MB in the end (delta: -531.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-01-09 12:58:56,431 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:58:56,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.15ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:58:56,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.18ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:58:56,431 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:58:56,432 INFO L158 Benchmark]: RCFGBuilder took 388.98ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 68.1MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:58:56,432 INFO L158 Benchmark]: TraceAbstraction took 33634.52ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 67.6MB in the beginning and 644.5MB in the end (delta: -576.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-01-09 12:58:56,432 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 721.4MB. Free memory was 644.5MB in the beginning and 644.4MB in the end (delta: 120.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:58:56,433 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.31ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.15ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 97.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.18ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.98ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 68.1MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 33634.52ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 67.6MB in the beginning and 644.5MB in the end (delta: -576.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 721.4MB. Free memory was 644.5MB in the beginning and 644.4MB in the end (delta: 120.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 199, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someUnaryFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -8; [L23] float var_1_2 = 1.5; [L24] float var_1_3 = 24.7; [L25] float var_1_8 = 0.875; [L26] float var_1_9 = 31.875; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 0.0; [L29] float var_1_12 = 7.58; [L30] float var_1_13 = 8.6; [L31] float var_1_14 = 49.75; [L32] signed short int var_1_16 = -64; [L33] signed long int var_1_18 = 4; [L34] signed long int var_1_19 = 100; [L35] unsigned char var_1_21 = 0; [L36] unsigned char var_1_23 = 0; [L37] signed char var_1_24 = 16; [L38] signed short int var_1_26 = -1; [L39] signed char var_1_27 = -32; [L40] unsigned char var_1_28 = 1; [L41] signed long int var_1_29 = -4; [L42] signed short int var_1_31 = 1000; [L43] signed long int var_1_32 = 4; [L44] signed short int var_1_33 = 8; [L45] signed short int var_1_34 = 25; [L46] signed short int var_1_35 = 100; [L47] signed short int var_1_36 = 10000; [L48] float var_1_38 = 2.125; [L49] signed long int var_1_39 = -1000000; [L50] signed long int last_1_var_1_1 = -8; [L51] float last_1_var_1_8 = 0.875; [L52] signed short int last_1_var_1_16 = -64; [L53] signed long int last_1_var_1_18 = 4; [L54] signed long int last_1_var_1_19 = 100; [L55] signed char last_1_var_1_24 = 16; [L56] signed long int last_1_var_1_29 = -4; [L57] signed short int last_1_var_1_31 = 1000; [L58] signed long int last_1_var_1_39 = -1000000; VAL [isInitial=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L203] isInitial = 1 [L204] FCALL initially() [L205] int k_loop; [L206] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L206] COND TRUE k_loop < 1 [L207] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_16 = var_1_16 [L191] last_1_var_1_18 = var_1_18 [L192] last_1_var_1_19 = var_1_19 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_29 = var_1_29 [L195] last_1_var_1_31 = var_1_31 [L196] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_2=3/2, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_2 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L146] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_3=247/10, var_1_8=7/8, var_1_9=255/8] [L147] var_1_3 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L148] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8, var_1_9=255/8] [L149] var_1_9 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L150] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_10=1021/4, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L151] var_1_10 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L152] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_11=0, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L153] var_1_11 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L154] RET assume_abort_if_not((var_1_11 >= 6917529.027641073700e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_12=379/50, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L155] var_1_12 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L156] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_13=43/5, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L157] var_1_13 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L158] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_14=199/4, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L159] var_1_14 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L161] var_1_23 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L162] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L163] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L164] var_1_26 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_26 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L165] RET assume_abort_if_not(var_1_26 >= -32768) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L167] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-32, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L169] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L170] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=4, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L171] var_1_32 = __VERIFIER_nondet_long() [L172] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L172] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L173] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=8, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L174] var_1_33 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L175] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L176] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=25, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L177] var_1_34 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] CALL assume_abort_if_not(var_1_34 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L179] RET assume_abort_if_not(var_1_34 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=100, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L180] var_1_35 = __VERIFIER_nondet_short() [L181] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L181] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] CALL assume_abort_if_not(var_1_35 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L182] RET assume_abort_if_not(var_1_35 <= 32766) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=10000, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L183] var_1_36 = __VERIFIER_nondet_short() [L184] CALL assume_abort_if_not(var_1_36 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L184] RET assume_abort_if_not(var_1_36 >= 8191) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] CALL assume_abort_if_not(var_1_36 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L185] RET assume_abort_if_not(var_1_36 <= 16383) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=-8, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L208] RET updateVariables() [L209] CALL step() [L62] COND TRUE (var_1_2 - var_1_3) >= last_1_var_1_8 [L63] var_1_1 = ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L67] signed long int stepLocal_6 = -5; [L68] signed long int stepLocal_5 = last_1_var_1_1; [L69] signed long int stepLocal_4 = (var_1_32 - 4) * last_1_var_1_24; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_5=-8, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L70] COND FALSE !(stepLocal_5 <= (last_1_var_1_18 * var_1_27)) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, stepLocal_6=-5, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=1000, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L77] COND FALSE !(stepLocal_6 <= last_1_var_1_39) [L80] var_1_31 = last_1_var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L83] COND FALSE !(((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=-64, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L90] COND FALSE !((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) [L97] var_1_16 = var_1_24 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=17/8, var_1_39=-1000000, var_1_8=7/8] [L99] COND FALSE !(var_1_35 <= var_1_27) [L102] var_1_38 = (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8] [L104] COND TRUE var_1_16 <= ((var_1_31 / -128) + var_1_1) [L105] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8] [L107] signed long int stepLocal_0 = 64; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_0=64, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8] [L108] COND FALSE !(stepLocal_0 <= var_1_24) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000, var_1_8=7/8] [L111] COND FALSE !(\read(var_1_21)) [L114] var_1_8 = (var_1_12 - 2.125f) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000] [L117] COND FALSE !(var_1_9 > var_1_13) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000] [L120] unsigned char stepLocal_2 = (var_1_31 + var_1_24) >= var_1_1; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_2=0, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000] [L121] COND FALSE !(stepLocal_2 || var_1_23) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000] [L124] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=-1000000] [L125] COND TRUE (last_1_var_1_39 <= var_1_31) || var_1_28 [L126] var_1_39 = var_1_36 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L129] unsigned char stepLocal_1 = var_1_21; VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_1=0, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=100, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L130] COND TRUE var_1_28 || stepLocal_1 [L131] var_1_19 = (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L133] signed long int stepLocal_3 = var_1_24 * (var_1_31 * var_1_16); VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_3=4096, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L134] COND FALSE !(-50 == stepLocal_3) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=-4, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L137] COND FALSE !(\read(var_1_23)) [L140] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, stepLocal_4=-64, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=952, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L209] RET step() [L210] CALL, EXPR property() [L199-L200] return (((((((((((((var_1_2 - var_1_3) >= last_1_var_1_8) ? (var_1_1 == ((signed long int) ((last_1_var_1_24 + last_1_var_1_31) + last_1_var_1_16))) : (var_1_1 == ((signed long int) last_1_var_1_16))) && ((64 <= var_1_24) ? (var_1_8 == ((float) (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) - (var_1_12 + (var_1_13 + var_1_14))))) : (var_1_21 ? (var_1_8 == ((float) (((((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) < 0 ) ? -((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))) : ((((var_1_13) > (var_1_11)) ? (var_1_13) : (var_1_11))))))) : (var_1_8 == ((float) (var_1_12 - 2.125f)))))) && (((((((var_1_2 * var_1_10)) > (var_1_11)) ? ((var_1_2 * var_1_10)) : (var_1_11))) > var_1_9) ? ((var_1_13 != var_1_2) ? (var_1_16 == ((signed short int) var_1_24)) : (var_1_16 == ((signed short int) var_1_24))) : (var_1_16 == ((signed short int) var_1_24)))) && ((var_1_9 > var_1_13) ? (var_1_18 == ((signed long int) (var_1_24 + var_1_31))) : 1)) && ((var_1_28 || var_1_21) ? (var_1_19 == ((signed long int) (((((var_1_31 + var_1_24)) > ((-8 + var_1_18))) ? ((var_1_31 + var_1_24)) : ((-8 + var_1_18)))))) : 1)) && ((var_1_16 <= ((var_1_31 / -128) + var_1_1)) ? (var_1_21 == ((unsigned char) var_1_23)) : 1)) && ((((var_1_13 * var_1_12) * var_1_3) != (var_1_14 + last_1_var_1_8)) ? ((last_1_var_1_29 >= (last_1_var_1_19 / var_1_26)) ? (var_1_24 == ((signed char) var_1_27)) : (var_1_24 == ((signed char) var_1_27))) : 1)) && ((((var_1_31 + var_1_24) >= var_1_1) || var_1_23) ? (var_1_28 == ((unsigned char) (var_1_21 && var_1_23))) : 1)) && ((-50 == (var_1_24 * (var_1_31 * var_1_16))) ? (var_1_29 == ((signed long int) ((((-500) < (var_1_18)) ? (-500) : (var_1_18))))) : (var_1_23 ? (var_1_29 == ((signed long int) var_1_1)) : (var_1_29 == ((signed long int) var_1_1))))) && ((last_1_var_1_1 <= (last_1_var_1_18 * var_1_27)) ? ((((((last_1_var_1_18) < (last_1_var_1_16)) ? (last_1_var_1_18) : (last_1_var_1_16))) == ((var_1_32 - 4) * last_1_var_1_24)) ? (var_1_31 == ((signed short int) ((var_1_33 + var_1_34) - var_1_35))) : (var_1_31 == ((signed short int) (((var_1_36 - 1) - var_1_33) + var_1_34)))) : ((-5 <= last_1_var_1_39) ? (var_1_31 == ((signed short int) var_1_27)) : (var_1_31 == ((signed short int) last_1_var_1_24))))) && ((var_1_35 <= var_1_27) ? (var_1_38 == ((float) var_1_9)) : (var_1_38 == ((float) (((((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) < 0 ) ? -((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))) : ((((var_1_13 - var_1_9) < 0 ) ? -(var_1_13 - var_1_9) : (var_1_13 - var_1_9))))))))) && ((! var_1_21) ? (((last_1_var_1_39 <= var_1_31) || var_1_28) ? (var_1_39 == ((signed long int) var_1_36)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=952, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=952, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-64, last_1_var_1_18=4, last_1_var_1_19=100, last_1_var_1_1=-8, last_1_var_1_24=16, last_1_var_1_29=-4, last_1_var_1_31=1000, last_1_var_1_39=-1000000, last_1_var_1_8=7/8, var_1_16=16, var_1_18=4, var_1_19=32, var_1_1=952, var_1_21=0, var_1_23=0, var_1_24=16, var_1_26=-1, var_1_27=-3, var_1_28=1, var_1_29=952, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=8191, var_1_38=2, var_1_39=8191] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 20, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5392 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5306 mSDsluCounter, 11755 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8841 mSDsCounter, 1295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7837 IncrementalHoareTripleChecker+Invalid, 9132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1295 mSolverCounterUnsat, 2914 mSDtfsCounter, 7837 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2477 GetRequests, 2208 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1010occurred in iteration=19, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 3865 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 5262 NumberOfCodeBlocks, 5262 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4211 ConstructedInterpolants, 5 QuantifiedInterpolants, 23584 SizeOfPredicates, 80 NumberOfNonLiveVariables, 4327 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 29496/30000 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:58:56,470 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-77.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 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:58:58,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:58:58,274 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:58:58,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:58:58,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:58:58,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:58:58,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:58:58,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:58:58,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:58:58,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:58:58,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:58:58,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:58:58,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:58:58,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:58:58,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:58:58,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:58:58,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:58:58,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:58:58,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:58:58,300 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 -> 0cbe4eb7aae73c01b831078f0e738c68709fa97155cdb7dce934011117170926 [2025-01-09 12:58:58,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:58:58,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:58:58,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:58:58,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:58:58,564 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:58:58,567 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-77.i [2025-01-09 12:58:59,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4592d70f8/576ad84268314da2aa05f8a50410305a/FLAG10f858ce7 [2025-01-09 12:58:59,919 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:58:59,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-01-09 12:58:59,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4592d70f8/576ad84268314da2aa05f8a50410305a/FLAG10f858ce7 [2025-01-09 12:59:00,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4592d70f8/576ad84268314da2aa05f8a50410305a [2025-01-09 12:59:00,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:59:00,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:59:00,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:00,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:59:00,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:59:00,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537f2d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00, skipping insertion in model container [2025-01-09 12:59:00,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:59:00,388 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-77.i[916,929] [2025-01-09 12:59:00,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:00,452 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:59:00,459 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-77.i[916,929] [2025-01-09 12:59:00,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:00,506 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:59:00,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00 WrapperNode [2025-01-09 12:59:00,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:00,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:00,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:59:00,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:59:00,514 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:59:00" (1/1) ... [2025-01-09 12:59:00,526 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:59:00" (1/1) ... [2025-01-09 12:59:00,552 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-01-09 12:59:00,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:00,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:59:00,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:59:00,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:59:00,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,589 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:59:00,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:59:00,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:59:00,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:59:00,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:59:00,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (1/1) ... [2025-01-09 12:59:00,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:00,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:00,639 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:59:00,642 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:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:59:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:59:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:59:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:59:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:59:00,738 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:59:00,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:59:09,739 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 12:59:09,739 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:59:09,750 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:59:09,750 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:59:09,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:09 BoogieIcfgContainer [2025-01-09 12:59:09,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:59:09,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:59:09,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:59:09,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:59:09,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:59:00" (1/3) ... [2025-01-09 12:59:09,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cca6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:09, skipping insertion in model container [2025-01-09 12:59:09,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:00" (2/3) ... [2025-01-09 12:59:09,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cca6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:09, skipping insertion in model container [2025-01-09 12:59:09,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:09" (3/3) ... [2025-01-09 12:59:09,758 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i [2025-01-09 12:59:09,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:59:09,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-77.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:59:09,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:59:09,822 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;@266cb45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:59:09,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:59:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:59:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 12:59:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:09,850 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:09,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:09,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1592543056, now seen corresponding path program 1 times [2025-01-09 12:59:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:59:09,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094865804] [2025-01-09 12:59:09,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:09,861 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:59:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:59:09,864 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:59:09,865 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:59:09,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 12:59:10,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 12:59:10,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:10,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:59:10,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:59:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-01-09 12:59:11,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:59:11,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:59:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094865804] [2025-01-09 12:59:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094865804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:59:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:59:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:59:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214883395] [2025-01-09 12:59:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:59:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:59:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:59:11,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:59:11,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:59:11,965 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-01-09 12:59:16,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:59:20,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:59:24,604 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:59:28,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:59:32,615 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:59:36,620 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:59:40,623 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:59:44,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:59:48,636 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 []