./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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-39.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'caf8cc95f60422cae62ef20857bff205d9812f0c6d7a17b53f59e7b912e3d243'] 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-39.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 caf8cc95f60422cae62ef20857bff205d9812f0c6d7a17b53f59e7b912e3d243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:58:17,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:58:17,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:58:17,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:58:17,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:58:17,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:58:17,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:58:17,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:58:17,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:58:17,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:58:17,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:58:17,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:58:17,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:58:17,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:58:17,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:58:17,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:58:17,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:58:17,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:58:17,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:58:17,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:58:17,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:58:17,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:58:17,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:58:17,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:58:17,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:58:17,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:58:17,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:58:17,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:58:17,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:58:17,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:58:17,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:58:17,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:58:17,556 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 -> caf8cc95f60422cae62ef20857bff205d9812f0c6d7a17b53f59e7b912e3d243 [2024-11-07 07:58:17,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:58:17,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:58:17,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:58:17,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:58:17,856 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:58:17,858 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-39.i [2024-11-07 07:58:19,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:58:19,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:58:19,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-39.i [2024-11-07 07:58:19,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f74dce0/1cd84816427049e9ae1f80675f2cbcbc/FLAG6f31b4324 [2024-11-07 07:58:19,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2f74dce0/1cd84816427049e9ae1f80675f2cbcbc [2024-11-07 07:58:19,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:58:19,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:58:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:58:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:58:19,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:58:19,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7f1f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19, skipping insertion in model container [2024-11-07 07:58:19,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:58:19,681 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-39.i[916,929] [2024-11-07 07:58:19,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:58:19,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:58:19,776 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-39.i[916,929] [2024-11-07 07:58:19,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:58:19,840 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:58:19,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19 WrapperNode [2024-11-07 07:58:19,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:58:19,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:58:19,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:58:19,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:58:19,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,908 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-11-07 07:58:19,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:58:19,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:58:19,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:58:19,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:58:19,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,953 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]. [2024-11-07 07:58:19,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:58:19,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:58:19,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:58:19,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:58:19,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (1/1) ... [2024-11-07 07:58:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:58:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:20,026 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) [2024-11-07 07:58:20,033 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 [2024-11-07 07:58:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:58:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:58:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:58:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:58:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:58:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:58:20,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:58:20,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:58:20,669 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 07:58:20,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:58:20,682 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:58:20,684 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:58:20,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:20 BoogieIcfgContainer [2024-11-07 07:58:20,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:58:20,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:58:20,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:58:20,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:58:20,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:58:19" (1/3) ... [2024-11-07 07:58:20,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39194164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:20, skipping insertion in model container [2024-11-07 07:58:20,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:19" (2/3) ... [2024-11-07 07:58:20,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39194164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:20, skipping insertion in model container [2024-11-07 07:58:20,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:20" (3/3) ... [2024-11-07 07:58:20,694 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-39.i [2024-11-07 07:58:20,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:58:20,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:58:20,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:58:20,780 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;@5e36ea76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:58:20,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:58:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:58:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-07 07:58:20,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:20,801 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:20,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:20,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1746816832, now seen corresponding path program 1 times [2024-11-07 07:58:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632510510] [2024-11-07 07:58:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:58:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:21,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632510510] [2024-11-07 07:58:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632510510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:58:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:58:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:58:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485650638] [2024-11-07 07:58:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:58:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:58:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:58:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:58:21,441 INFO L87 Difference]: Start difference. First operand has 91 states, 64 states have (on average 1.421875) internal successors, (91), 65 states have internal predecessors, (91), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:58:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:21,471 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2024-11-07 07:58:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:58:21,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2024-11-07 07:58:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:21,481 INFO L225 Difference]: With dead ends: 179 [2024-11-07 07:58:21,482 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 07:58:21,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:58:21,490 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:21,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:58:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 07:58:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 07:58:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:58:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-07 07:58:21,545 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 166 [2024-11-07 07:58:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:21,546 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-07 07:58:21,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 07:58:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-07 07:58:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-07 07:58:21,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:21,552 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:21,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:58:21,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2120324980, now seen corresponding path program 1 times [2024-11-07 07:58:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820224745] [2024-11-07 07:58:21,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:21,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:58:23,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820224745] [2024-11-07 07:58:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820224745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:58:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:58:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:58:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332184421] [2024-11-07 07:58:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:58:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:58:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:58:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:58:23,565 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:24,846 INFO L93 Difference]: Finished difference Result 363 states and 545 transitions. [2024-11-07 07:58:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:58:24,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-07 07:58:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:24,850 INFO L225 Difference]: With dead ends: 363 [2024-11-07 07:58:24,851 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 07:58:24,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:58:24,852 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 444 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:24,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 580 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 07:58:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 07:58:24,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 191. [2024-11-07 07:58:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 140 states have (on average 1.4285714285714286) internal successors, (200), 140 states have internal predecessors, (200), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:58:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 296 transitions. [2024-11-07 07:58:24,899 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 296 transitions. Word has length 166 [2024-11-07 07:58:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:24,899 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 296 transitions. [2024-11-07 07:58:24,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2024-11-07 07:58:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-07 07:58:24,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:24,906 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:58:24,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:24,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:24,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1862159542, now seen corresponding path program 1 times [2024-11-07 07:58:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584417859] [2024-11-07 07:58:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584417859] [2024-11-07 07:58:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584417859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:58:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434465213] [2024-11-07 07:58:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:25,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:25,338 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) [2024-11-07 07:58:25,340 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 [2024-11-07 07:58:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:25,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:58:25,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:58:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-07 07:58:25,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:58:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434465213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:58:26,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:58:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 07:58:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548871963] [2024-11-07 07:58:26,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:58:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:58:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:58:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:58:26,058 INFO L87 Difference]: Start difference. First operand 191 states and 296 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-07 07:58:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:26,265 INFO L93 Difference]: Finished difference Result 391 states and 599 transitions. [2024-11-07 07:58:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:58:26,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 166 [2024-11-07 07:58:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:26,268 INFO L225 Difference]: With dead ends: 391 [2024-11-07 07:58:26,269 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 07:58:26,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:58:26,272 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 129 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:26,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 257 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:58:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 07:58:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2024-11-07 07:58:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 146 states have (on average 1.36986301369863) internal successors, (200), 146 states have internal predecessors, (200), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:58:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2024-11-07 07:58:26,321 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 166 [2024-11-07 07:58:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:26,323 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2024-11-07 07:58:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-07 07:58:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2024-11-07 07:58:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 07:58:26,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:26,329 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:26,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:58:26,529 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 [2024-11-07 07:58:26,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 870394147, now seen corresponding path program 1 times [2024-11-07 07:58:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193950542] [2024-11-07 07:58:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:58:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193950542] [2024-11-07 07:58:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193950542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:58:26,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:58:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:58:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430432443] [2024-11-07 07:58:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:58:26,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:58:26,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:58:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:58:26,906 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:27,039 INFO L93 Difference]: Finished difference Result 555 states and 813 transitions. [2024-11-07 07:58:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:58:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-07 07:58:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:27,046 INFO L225 Difference]: With dead ends: 555 [2024-11-07 07:58:27,046 INFO L226 Difference]: Without dead ends: 359 [2024-11-07 07:58:27,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:58:27,048 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 217 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:27,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 260 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:58:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-07 07:58:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 239. [2024-11-07 07:58:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 184 states have (on average 1.358695652173913) internal successors, (250), 184 states have internal predecessors, (250), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:58:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 346 transitions. [2024-11-07 07:58:27,100 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 346 transitions. Word has length 167 [2024-11-07 07:58:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:27,101 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 346 transitions. [2024-11-07 07:58:27,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 346 transitions. [2024-11-07 07:58:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 07:58:27,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:27,105 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:58:27,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -409469531, now seen corresponding path program 1 times [2024-11-07 07:58:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171059709] [2024-11-07 07:58:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171059709] [2024-11-07 07:58:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171059709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:58:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523512421] [2024-11-07 07:58:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:27,471 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) [2024-11-07 07:58:27,473 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 [2024-11-07 07:58:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:27,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:58:27,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:58:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-07 07:58:27,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:58:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523512421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:58:28,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:58:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 07:58:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000030414] [2024-11-07 07:58:28,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:58:28,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:58:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:58:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:58:28,032 INFO L87 Difference]: Start difference. First operand 239 states and 346 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 07:58:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:28,261 INFO L93 Difference]: Finished difference Result 491 states and 703 transitions. [2024-11-07 07:58:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:58:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 167 [2024-11-07 07:58:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:28,264 INFO L225 Difference]: With dead ends: 491 [2024-11-07 07:58:28,264 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 07:58:28,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:58:28,269 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 76 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:28,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 250 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:58:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 07:58:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 215. [2024-11-07 07:58:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 158 states have (on average 1.3037974683544304) internal successors, (206), 158 states have internal predecessors, (206), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:58:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2024-11-07 07:58:28,303 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 167 [2024-11-07 07:58:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:28,303 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2024-11-07 07:58:28,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 07:58:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2024-11-07 07:58:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 07:58:28,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:28,305 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:28,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 07:58:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:28,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1010942757, now seen corresponding path program 1 times [2024-11-07 07:58:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770378652] [2024-11-07 07:58:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:28,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770378652] [2024-11-07 07:58:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770378652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:58:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800593193] [2024-11-07 07:58:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:29,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:29,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:29,293 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) [2024-11-07 07:58:29,295 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 [2024-11-07 07:58:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:29,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 07:58:29,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:58:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 132 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 07:58:30,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:58:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:58:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800593193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:58:31,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:58:31,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-11-07 07:58:31,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492867198] [2024-11-07 07:58:31,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:58:31,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 07:58:31,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 07:58:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-11-07 07:58:31,157 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-07 07:58:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:35,770 INFO L93 Difference]: Finished difference Result 889 states and 1212 transitions. [2024-11-07 07:58:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-07 07:58:35,771 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 167 [2024-11-07 07:58:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:35,777 INFO L225 Difference]: With dead ends: 889 [2024-11-07 07:58:35,778 INFO L226 Difference]: Without dead ends: 677 [2024-11-07 07:58:35,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1095, Invalid=4911, Unknown=0, NotChecked=0, Total=6006 [2024-11-07 07:58:35,782 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2051 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:35,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 1187 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 07:58:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-07 07:58:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 435. [2024-11-07 07:58:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 314 states have (on average 1.2643312101910829) internal successors, (397), 314 states have internal predecessors, (397), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 07:58:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 589 transitions. [2024-11-07 07:58:35,857 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 589 transitions. Word has length 167 [2024-11-07 07:58:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:35,858 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 589 transitions. [2024-11-07 07:58:35,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 22 states have internal predecessors, (133), 6 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-07 07:58:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 589 transitions. [2024-11-07 07:58:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 07:58:35,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:35,860 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:35,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 07:58:36,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:36,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:36,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:36,063 INFO L85 PathProgramCache]: Analyzing trace with hash 533922601, now seen corresponding path program 1 times [2024-11-07 07:58:36,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488523766] [2024-11-07 07:58:36,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 123 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 07:58:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488523766] [2024-11-07 07:58:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488523766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:58:36,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478762576] [2024-11-07 07:58:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:36,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:36,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:36,771 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) [2024-11-07 07:58:36,773 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 [2024-11-07 07:58:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:37,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 07:58:37,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:58:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 132 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 07:58:38,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:58:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478762576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:58:40,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:58:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2024-11-07 07:58:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667186468] [2024-11-07 07:58:40,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:58:40,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 07:58:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 07:58:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=473, Unknown=3, NotChecked=0, Total=552 [2024-11-07 07:58:40,199 INFO L87 Difference]: Start difference. First operand 435 states and 589 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (47), 3 states have call predecessors, (47), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-07 07:58:48,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 07:58:49,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 07:58:55,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 07:58:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:57,437 INFO L93 Difference]: Finished difference Result 1533 states and 2038 transitions. [2024-11-07 07:58:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-07 07:58:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (47), 3 states have call predecessors, (47), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 167 [2024-11-07 07:58:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:57,449 INFO L225 Difference]: With dead ends: 1533 [2024-11-07 07:58:57,449 INFO L226 Difference]: Without dead ends: 1101 [2024-11-07 07:58:57,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=930, Invalid=3605, Unknown=21, NotChecked=0, Total=4556 [2024-11-07 07:58:57,455 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 686 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 220 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:57,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1703 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2306 Invalid, 73 Unknown, 0 Unchecked, 15.2s Time] [2024-11-07 07:58:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-07 07:58:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 608. [2024-11-07 07:58:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 451 states have (on average 1.2682926829268293) internal successors, (572), 451 states have internal predecessors, (572), 120 states have call successors, (120), 36 states have call predecessors, (120), 36 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-07 07:58:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 812 transitions. [2024-11-07 07:58:57,575 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 812 transitions. Word has length 167 [2024-11-07 07:58:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:57,576 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 812 transitions. [2024-11-07 07:58:57,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (47), 3 states have call predecessors, (47), 4 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-07 07:58:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 812 transitions. [2024-11-07 07:58:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 07:58:57,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:57,580 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:57,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 07:58:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-07 07:58:57,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1618961943, now seen corresponding path program 1 times [2024-11-07 07:58:57,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:57,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697660741] [2024-11-07 07:58:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:58:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:58:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:58:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:58:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:58:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:58:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:58:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:58:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 07:58:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 07:58:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 07:58:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 07:58:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 07:58:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 07:58:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 07:58:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 07:58:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 07:58:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 07:58:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 07:58:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 07:58:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 07:58:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 07:58:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-07 07:58:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-07 07:58:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:58:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 07:58:57,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:58:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697660741] [2024-11-07 07:58:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697660741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:58:57,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:58:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:58:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976084439] [2024-11-07 07:58:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:58:57,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:58:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:58:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:58:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:58:57,998 INFO L87 Difference]: Start difference. First operand 608 states and 812 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:58:58,141 INFO L93 Difference]: Finished difference Result 1427 states and 1906 transitions. [2024-11-07 07:58:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:58:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-07 07:58:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:58:58,149 INFO L225 Difference]: With dead ends: 1427 [2024-11-07 07:58:58,149 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 07:58:58,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:58:58,152 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 66 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:58:58,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 466 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:58:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 07:58:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 820. [2024-11-07 07:58:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 601 states have (on average 1.2612312811980033) internal successors, (758), 601 states have internal predecessors, (758), 168 states have call successors, (168), 50 states have call predecessors, (168), 50 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-07 07:58:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1094 transitions. [2024-11-07 07:58:58,265 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1094 transitions. Word has length 167 [2024-11-07 07:58:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:58:58,265 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1094 transitions. [2024-11-07 07:58:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 07:58:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1094 transitions. [2024-11-07 07:58:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 07:58:58,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:58:58,267 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:58,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:58:58,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:58:58,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:58:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 509133778, now seen corresponding path program 1 times [2024-11-07 07:58:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:58:58,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474870006] [2024-11-07 07:58:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:58:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:58:58,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314117827] [2024-11-07 07:58:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:58:58,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:58,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:58:58,412 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) [2024-11-07 07:58:58,413 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 [2024-11-07 07:58:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:58:58,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:58:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:58:58,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:58:58,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:58:58,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:58:58,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 07:58:59,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:58:59,071 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:58:59,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:58:59,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:58:59 BoogieIcfgContainer [2024-11-07 07:58:59,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:58:59,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:58:59,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:58:59,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:58:59,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:20" (3/4) ... [2024-11-07 07:58:59,191 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:58:59,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:58:59,193 INFO L158 Benchmark]: Toolchain (without parser) took 39675.54ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 91.1MB in the beginning and 174.6MB in the end (delta: -83.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,193 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:58:59,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.84ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 74.1MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 69.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,193 INFO L158 Benchmark]: Boogie Preprocessor took 78.04ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 59.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,194 INFO L158 Benchmark]: RCFGBuilder took 696.76ms. Allocated memory is still 117.4MB. Free memory was 59.3MB in the beginning and 72.3MB in the end (delta: -13.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,194 INFO L158 Benchmark]: TraceAbstraction took 38501.07ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 71.8MB in the beginning and 174.7MB in the end (delta: -102.8MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,194 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 276.8MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 67.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:58:59,195 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.45ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.84ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 74.1MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 69.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.04ms. Allocated memory is still 117.4MB. Free memory was 69.0MB in the beginning and 59.3MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 696.76ms. Allocated memory is still 117.4MB. Free memory was 59.3MB in the beginning and 72.3MB in the end (delta: -13.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38501.07ms. Allocated memory was 117.4MB in the beginning and 276.8MB in the end (delta: 159.4MB). Free memory was 71.8MB in the beginning and 174.7MB in the end (delta: -102.8MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 276.8MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 67.6kB). Peak memory consumption was 8.4MB. 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 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned short int var_1_4 = 8; [L24] unsigned short int var_1_5 = 5; [L25] unsigned long int var_1_6 = 256; [L26] float var_1_7 = 9999999999999.2; [L27] float var_1_8 = 499.5; [L28] float var_1_9 = 64.4; [L29] float var_1_10 = 0.5; [L30] float var_1_11 = 5.8; [L31] float var_1_12 = 16.75; [L32] float var_1_13 = 99.5; [L33] signed short int var_1_15 = -10; [L34] unsigned char var_1_17 = 0; [L35] unsigned long int var_1_19 = 2743323310; [L36] unsigned long int var_1_20 = 4162860161; [L37] unsigned char var_1_21 = 0; [L38] double var_1_22 = 99.7; [L39] unsigned long int var_1_23 = 8; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 128; [L42] unsigned char var_1_26 = 128; [L43] unsigned char var_1_27 = 32; [L44] unsigned char var_1_28 = 200; [L45] float var_1_29 = 16.1; [L46] float var_1_30 = 7.9; [L47] unsigned char var_1_31 = 0; [L48] unsigned char var_1_32 = 1; [L49] unsigned char var_1_33 = 8; [L50] signed short int last_1_var_1_15 = -10; [L51] double last_1_var_1_22 = 99.7; [L52] unsigned long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 1; [L54] unsigned char last_1_var_1_27 = 32; [L55] unsigned char last_1_var_1_31 = 0; VAL [isInitial=0, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L200] isInitial = 1 [L201] FCALL initially() [L202] int k_loop; [L203] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L203] COND TRUE k_loop < 1 [L204] CALL updateLastVariables() [L188] last_1_var_1_15 = var_1_15 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 [L191] last_1_var_1_24 = var_1_24 [L192] last_1_var_1_27 = var_1_27 [L193] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=8, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_4 >= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L148] RET assume_abort_if_not(var_1_4 >= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] CALL assume_abort_if_not(var_1_4 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L149] RET assume_abort_if_not(var_1_4 <= 17) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=5, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L150] var_1_5 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L151] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] CALL assume_abort_if_not(var_1_5 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L152] RET assume_abort_if_not(var_1_5 <= 8) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_8=999/2, var_1_9=322/5] [L153] var_1_8 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L154] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5, var_1_9=322/5] [L155] var_1_9 = __VERIFIER_nondet_float() [L156] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L156] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_10=1/2, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L157] var_1_10 = __VERIFIER_nondet_float() [L158] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L158] 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=29/5, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L159] var_1_11 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L160] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && 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_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_12=67/4, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L161] var_1_12 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L162] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_13=199/2, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L163] var_1_13 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L164] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2743323310, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L167] RET assume_abort_if_not(var_1_19 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=4162860161, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L168] var_1_20 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L169] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L170] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L173] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=128, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L174] var_1_25 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_25 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L175] RET assume_abort_if_not(var_1_25 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L176] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=128, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L178] RET assume_abort_if_not(var_1_26 >= 127) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L179] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=200, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L180] var_1_28 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_28 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L181] RET assume_abort_if_not(var_1_28 >= 190) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L182] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L183] var_1_32 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L184] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L185] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=256, var_1_7=49999999999996/5] [L205] RET updateVariables() [L206] CALL step() [L59] COND TRUE (var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24)))) [L60] var_1_6 = 200u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L62] COND FALSE !(\read(last_1_var_1_31)) [L73] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L75] COND FALSE !(\read(var_1_17)) [L78] var_1_31 = (! 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=200, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L80] unsigned long int stepLocal_0 = (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5); [L81] COND FALSE !(stepLocal_0 <= -128) [L84] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L86] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_4=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=997/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5] [L87] COND TRUE stepLocal_4 || (last_1_var_1_22 <= var_1_12) [L88] var_1_22 = ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L92] signed long int stepLocal_6 = (((var_1_25) > (256)) ? (var_1_25) : (256)); VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_6=256, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=32, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L93] COND TRUE var_1_5 <= stepLocal_6 [L94] var_1_27 = ((var_1_28 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_29=161/10, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L98] var_1_29 = (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L99] COND TRUE var_1_19 != 25u VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=79/10, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_9=0] [L100] COND TRUE ! var_1_21 [L101] var_1_30 = var_1_8 VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L106] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L111] signed long int stepLocal_5 = var_1_33 % var_1_4; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_5=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L112] COND FALSE !(stepLocal_5 > var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L115] unsigned long int stepLocal_3 = var_1_6; [L116] signed long int stepLocal_2 = 128; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, stepLocal_3=200, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L117] COND FALSE !(var_1_1 > stepLocal_3) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_2=128, var_1_15=-10, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L120] COND TRUE var_1_33 != stepLocal_2 [L121] var_1_15 = (var_1_5 - 1) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L126] COND FALSE !(((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L137] signed long int stepLocal_1 = var_1_33 + var_1_5; VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, stepLocal_1=16, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=49999999999996/5, var_1_8=2, var_1_9=0] [L138] COND TRUE stepLocal_1 > var_1_24 [L139] var_1_7 = (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L206] RET step() [L207] CALL, EXPR property() [L196] EXPR (last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L196-L197] return (((((((((((((((last_1_var_1_23 * last_1_var_1_15) << (var_1_4 - var_1_5)) <= -128) ? (var_1_1 == ((unsigned char) (var_1_5 + var_1_4))) : (var_1_1 == ((unsigned char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && (((var_1_4 >= last_1_var_1_24) && (last_1_var_1_27 >= ((((var_1_5) < (last_1_var_1_24)) ? (var_1_5) : (last_1_var_1_24))))) ? (var_1_6 == ((unsigned long int) 200u)) : 1)) && (((var_1_33 + var_1_5) > var_1_24) ? (var_1_7 == ((float) (((((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) > (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13)))))) ? ((((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)) : (((((var_1_11) > ((var_1_12 + var_1_13))) ? (var_1_11) : ((var_1_12 + var_1_13))))))))) : ((! var_1_31) ? (var_1_7 == ((float) ((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13))))) : 1))) && ((var_1_1 > var_1_6) ? (var_1_15 == ((signed short int) last_1_var_1_15)) : ((var_1_33 != 128) ? (var_1_15 == ((signed short int) (var_1_5 - 1))) : (var_1_15 == ((signed short int) var_1_27))))) && (last_1_var_1_31 ? (last_1_var_1_31 ? (((((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))) - ((((10u) > (var_1_5)) ? (10u) : (var_1_5)))) != var_1_4) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0))) : (var_1_17 == ((unsigned char) var_1_21))) : (var_1_17 == ((unsigned char) var_1_21)))) && ((var_1_17 || (last_1_var_1_22 <= var_1_12)) ? (var_1_22 == ((double) ((((200.3) < (var_1_9)) ? (200.3) : (var_1_9))))) : (var_1_22 == ((double) (var_1_8 - var_1_9))))) && ((((((var_1_1) < ((var_1_4 - var_1_5))) ? (var_1_1) : ((var_1_4 - var_1_5)))) > var_1_27) ? (((5 * var_1_27) <= var_1_24) ? ((var_1_5 >= var_1_1) ? (var_1_23 == ((unsigned long int) var_1_24)) : (var_1_23 == ((unsigned long int) var_1_5))) : (var_1_23 == ((unsigned long int) var_1_4))) : 1)) && (((var_1_33 % var_1_4) > var_1_5) ? (var_1_24 == ((unsigned char) (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))) - var_1_4))) : 1)) && ((var_1_5 <= ((((var_1_25) > (256)) ? (var_1_25) : (256)))) ? (var_1_27 == ((unsigned char) ((var_1_28 - var_1_4) - var_1_5))) : (var_1_27 == ((unsigned char) (((((var_1_25) > (var_1_28)) ? (var_1_25) : (var_1_28))) - var_1_5))))) && (var_1_29 == ((float) (var_1_12 + ((((9.999999999999995E14f) > (var_1_13)) ? (9.999999999999995E14f) : (var_1_13))))))) && ((var_1_19 != 25u) ? ((! var_1_21) ? (var_1_30 == ((float) var_1_8)) : 1) : (var_1_30 == ((float) (var_1_10 - var_1_9))))) && (var_1_17 ? (var_1_31 == ((unsigned char) (! var_1_32))) : (var_1_31 == ((unsigned char) (! 1))))) && (var_1_31 ? (((var_1_6 / var_1_25) <= var_1_4) ? (var_1_33 == ((unsigned char) var_1_5)) : 1) : 1) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-10, last_1_var_1_22=997/10, last_1_var_1_23=8, last_1_var_1_24=1, last_1_var_1_27=32, last_1_var_1_31=0, var_1_11=0, var_1_15=7, var_1_17=0, var_1_19=2147483647, var_1_1=8, var_1_20=2147483647, var_1_21=0, var_1_22=2003/10, var_1_23=8, var_1_24=1, var_1_25=201, var_1_26=127, var_1_27=174, var_1_28=190, var_1_30=2, var_1_31=0, var_1_32=1, var_1_33=8, var_1_4=-65528, var_1_5=8, var_1_6=200, var_1_7=3, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 3695 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3669 mSDsluCounter, 4839 SdHoareTripleChecker+Invalid, 18.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3666 mSDsCounter, 1022 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4319 IncrementalHoareTripleChecker+Invalid, 5414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1022 mSolverCounterUnsat, 1173 mSDtfsCounter, 4319 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1772 GetRequests, 1593 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=820occurred in iteration=8, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 957 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2336 NumberOfCodeBlocks, 2336 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2485 ConstructedInterpolants, 3 QuantifiedInterpolants, 8907 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1638 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 15852/16560 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:58:59,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-39.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 caf8cc95f60422cae62ef20857bff205d9812f0c6d7a17b53f59e7b912e3d243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:59:01,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:59:01,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:59:01,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:59:01,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:59:01,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:59:01,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:59:01,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:59:01,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:59:01,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:59:01,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:59:01,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:59:01,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:59:01,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:59:01,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:59:01,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:59:01,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:59:01,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:59:01,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:59:01,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:59:01,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:59:01,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:59:01,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:59:01,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:59:01,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:59:01,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:59:01,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:59:01,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:59:01,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:59:01,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:59:01,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:59:01,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:59:01,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:59:01,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:59:01,576 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 -> caf8cc95f60422cae62ef20857bff205d9812f0c6d7a17b53f59e7b912e3d243 [2024-11-07 07:59:01,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:59:01,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:59:01,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:59:01,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:59:01,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:59:01,929 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-39.i [2024-11-07 07:59:03,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:59:03,540 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:59:03,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-39.i [2024-11-07 07:59:03,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fd26cd03/bcdf03c674d147cba917f89009b994bd/FLAGbefbb92c3 [2024-11-07 07:59:03,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5fd26cd03/bcdf03c674d147cba917f89009b994bd [2024-11-07 07:59:03,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:59:03,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:59:03,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:59:03,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:59:03,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:59:03,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c43d9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03, skipping insertion in model container [2024-11-07 07:59:03,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:59:03,714 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-39.i[916,929] [2024-11-07 07:59:03,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:59:03,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:59:03,812 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-39.i[916,929] [2024-11-07 07:59:03,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:59:03,878 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:59:03,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03 WrapperNode [2024-11-07 07:59:03,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:59:03,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:59:03,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:59:03,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:59:03,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,940 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-07 07:59:03,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:59:03,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:59:03,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:59:03,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:59:03,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,984 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]. [2024-11-07 07:59:03,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:03,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:59:04,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:59:04,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:59:04,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:59:04,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (1/1) ... [2024-11-07 07:59:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:59:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:59:04,061 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) [2024-11-07 07:59:04,064 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 [2024-11-07 07:59:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:59:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:59:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:59:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:59:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:59:04,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:59:04,161 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:59:04,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:59:09,442 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-07 07:59:09,442 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:59:09,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:59:09,455 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:59:09,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:09 BoogieIcfgContainer [2024-11-07 07:59:09,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:59:09,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:59:09,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:59:09,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:59:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:59:03" (1/3) ... [2024-11-07 07:59:09,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794d7536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:09, skipping insertion in model container [2024-11-07 07:59:09,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:59:03" (2/3) ... [2024-11-07 07:59:09,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794d7536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:59:09, skipping insertion in model container [2024-11-07 07:59:09,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:59:09" (3/3) ... [2024-11-07 07:59:09,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-39.i [2024-11-07 07:59:09,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:59:09,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:59:09,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:59:09,533 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;@66b5f3d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:59:09,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:59:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:59:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 07:59:09,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:09,553 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:59:09,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:09,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1856691040, now seen corresponding path program 1 times [2024-11-07 07:59:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:59:09,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931830655] [2024-11-07 07:59:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:09,567 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 [2024-11-07 07:59:09,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:59:09,570 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) [2024-11-07 07:59:09,572 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 [2024-11-07 07:59:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:10,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:59:10,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-07 07:59:10,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:59:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:59:11,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:59:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931830655] [2024-11-07 07:59:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931830655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:59:11,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:59:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 07:59:11,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313252021] [2024-11-07 07:59:11,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:59:11,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:59:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:59:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:59:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:59:11,755 INFO L87 Difference]: Start difference. First operand has 86 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 07:59:16,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:59:19,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:59:21,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:59:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:21,160 INFO L93 Difference]: Finished difference Result 177 states and 295 transitions. [2024-11-07 07:59:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:59:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 163 [2024-11-07 07:59:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:21,203 INFO L225 Difference]: With dead ends: 177 [2024-11-07 07:59:21,203 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 07:59:21,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 07:59:21,209 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 152 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:21,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 237 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2024-11-07 07:59:21,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 07:59:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-07 07:59:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:59:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-07 07:59:21,264 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 163 [2024-11-07 07:59:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:21,265 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-07 07:59:21,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-07 07:59:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-07 07:59:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 07:59:21,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:21,270 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:59:21,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:59:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:59:21,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1433989214, now seen corresponding path program 1 times [2024-11-07 07:59:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:59:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785793975] [2024-11-07 07:59:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:21,473 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 [2024-11-07 07:59:21,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:59:21,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:59:21,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:59:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:21,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:59:21,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-07 07:59:22,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:59:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 07:59:23,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:59:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785793975] [2024-11-07 07:59:23,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785793975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:59:23,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:59:23,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 07:59:23,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563901304] [2024-11-07 07:59:23,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:59:23,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:59:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:59:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:59:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:59:23,703 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-07 07:59:28,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:59:30,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:59:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:59:30,521 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2024-11-07 07:59:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 07:59:30,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 163 [2024-11-07 07:59:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:59:30,557 INFO L225 Difference]: With dead ends: 177 [2024-11-07 07:59:30,557 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 07:59:30,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:59:30,558 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 113 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-07 07:59:30,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 229 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-11-07 07:59:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 07:59:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-07 07:59:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:59:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-11-07 07:59:30,577 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 163 [2024-11-07 07:59:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:59:30,578 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-11-07 07:59:30,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-11-07 07:59:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-11-07 07:59:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 07:59:30,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:59:30,581 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:59:30,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:59:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:59:30,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:59:30,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:59:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -800289950, now seen corresponding path program 1 times [2024-11-07 07:59:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:59:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170926472] [2024-11-07 07:59:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:30,785 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 [2024-11-07 07:59:30,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:59:30,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:59:30,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:59:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:31,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 07:59:31,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:59:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 219 proven. 123 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-07 07:59:34,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:59:35,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:59:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170926472] [2024-11-07 07:59:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170926472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:59:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988484555] [2024-11-07 07:59:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:59:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:59:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:59:35,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:59:35,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 07:59:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:59:37,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 07:59:37,300 INFO L278 TraceCheckSpWp]: Computing forward predicates...