./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.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_fillercode_fillercodestructure_filler-pr-ci_file-29.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', '8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d'] 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_fillercode_fillercodestructure_filler-pr-ci_file-29.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 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:17:52,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:17:52,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:17:52,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:17:52,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:17:52,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:17:52,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:17:52,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:17:52,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:17:52,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:17:52,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:17:52,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:17:52,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:17:52,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:17:52,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:17:52,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:17:52,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:17:52,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:17:52,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:17:52,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:17:52,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:17:52,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:17:52,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:17:52,721 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 -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2024-11-07 06:17:53,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:17:53,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:17:53,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:17:53,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:17:53,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:17:53,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:17:54,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:17:54,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:17:54,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:17:54,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb6d1c76c/02b682b538d0439b9fc3e737a2dd5d09/FLAG7f9971cfc [2024-11-07 06:17:54,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb6d1c76c/02b682b538d0439b9fc3e737a2dd5d09 [2024-11-07 06:17:54,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:17:54,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:17:54,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:17:54,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:17:54,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:17:54,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:17:54" (1/1) ... [2024-11-07 06:17:54,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5176bb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:54, skipping insertion in model container [2024-11-07 06:17:54,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:17:54" (1/1) ... [2024-11-07 06:17:54,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:17:55,071 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_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-11-07 06:17:55,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:17:55,188 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:17:55,201 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_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-11-07 06:17:55,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:17:55,277 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:17:55,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55 WrapperNode [2024-11-07 06:17:55,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:17:55,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:17:55,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:17:55,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:17:55,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,357 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-07 06:17:55,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:17:55,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:17:55,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:17:55,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:17:55,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,407 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 06:17:55,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:17:55,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:17:55,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:17:55,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:17:55,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (1/1) ... [2024-11-07 06:17:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:17:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:17:55,494 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 06:17:55,497 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 06:17:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:17:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:17:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:17:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:17:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:17:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:17:55,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:17:55,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:17:56,112 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 06:17:56,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:17:56,124 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:17:56,124 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:17:56,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:17:56 BoogieIcfgContainer [2024-11-07 06:17:56,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:17:56,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:17:56,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:17:56,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:17:56,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:17:54" (1/3) ... [2024-11-07 06:17:56,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6621ecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:17:56, skipping insertion in model container [2024-11-07 06:17:56,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:17:55" (2/3) ... [2024-11-07 06:17:56,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6621ecf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:17:56, skipping insertion in model container [2024-11-07 06:17:56,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:17:56" (3/3) ... [2024-11-07 06:17:56,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:17:56,150 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:17:56,151 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:17:56,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:17:56,232 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;@4367e6c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:17:56,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:17:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:17:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 06:17:56,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:56,258 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:56,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1971132648, now seen corresponding path program 1 times [2024-11-07 06:17:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:17:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271696090] [2024-11-07 06:17:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:17:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:17:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:17:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:17:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:17:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:17:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:17:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:17:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:17:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:17:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:17:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:17:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:17:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:17:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:17:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:17:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:17:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:17:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:17:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:17:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:17:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:17:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:17:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:17:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:17:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:17:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:17:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:17:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:17:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:17:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:17:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271696090] [2024-11-07 06:17:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271696090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:17:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:17:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:17:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986920631] [2024-11-07 06:17:57,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:17:57,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:17:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:17:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:17:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:57,091 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:17:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:57,207 INFO L93 Difference]: Finished difference Result 195 states and 345 transitions. [2024-11-07 06:17:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:17:57,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-07 06:17:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:57,222 INFO L225 Difference]: With dead ends: 195 [2024-11-07 06:17:57,223 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 06:17:57,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:57,233 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:57,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 250 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:17:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 06:17:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-07 06:17:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 06:17:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-07 06:17:57,285 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 178 [2024-11-07 06:17:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:57,287 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-07 06:17:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:17:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2024-11-07 06:17:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 06:17:57,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:57,291 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:57,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:17:57,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:57,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1342365912, now seen corresponding path program 1 times [2024-11-07 06:17:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:17:57,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337770193] [2024-11-07 06:17:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:17:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:17:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:17:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:17:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:17:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:17:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:17:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:17:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:17:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:17:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:17:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:17:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:17:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:17:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:17:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:17:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:17:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:17:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:17:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:17:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:17:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:17:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:17:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:17:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:17:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:17:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:17:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:17:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:17:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:17:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:17:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337770193] [2024-11-07 06:17:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337770193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:17:57,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:17:57,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:17:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685156963] [2024-11-07 06:17:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:17:57,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:17:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:17:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:17:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:57,782 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:17:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:57,876 INFO L93 Difference]: Finished difference Result 209 states and 321 transitions. [2024-11-07 06:17:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:17:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2024-11-07 06:17:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:57,887 INFO L225 Difference]: With dead ends: 209 [2024-11-07 06:17:57,888 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 06:17:57,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:17:57,889 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:57,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:17:57,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 06:17:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 06:17:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 06:17:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 161 transitions. [2024-11-07 06:17:57,920 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 161 transitions. Word has length 179 [2024-11-07 06:17:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:57,921 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 161 transitions. [2024-11-07 06:17:57,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:17:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 161 transitions. [2024-11-07 06:17:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 06:17:57,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:57,927 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:57,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:17:57,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 949338902, now seen corresponding path program 1 times [2024-11-07 06:17:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:17:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854643129] [2024-11-07 06:17:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:17:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:17:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:17:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:17:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:17:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:17:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:17:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:17:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:17:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:17:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:17:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:17:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:17:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:17:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:17:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:17:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:17:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:17:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 06:17:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:17:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 06:17:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 06:17:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 06:17:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 06:17:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 06:17:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 06:17:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 06:17:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 06:17:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 06:17:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:17:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:17:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854643129] [2024-11-07 06:17:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854643129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:17:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954599660] [2024-11-07 06:17:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:58,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:17:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:17:58,662 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 06:17:58,664 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 06:17:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:58,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 06:17:58,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:17:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-07 06:17:59,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:17:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:17:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954599660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:17:59,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:17:59,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-07 06:17:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072583043] [2024-11-07 06:17:59,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:17:59,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 06:17:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:17:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 06:17:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:17:59,649 INFO L87 Difference]: Start difference. First operand 106 states and 161 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-11-07 06:18:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:00,141 INFO L93 Difference]: Finished difference Result 217 states and 326 transitions. [2024-11-07 06:18:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:18:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) Word has length 179 [2024-11-07 06:18:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:00,144 INFO L225 Difference]: With dead ends: 217 [2024-11-07 06:18:00,146 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 06:18:00,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:18:00,149 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 409 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:18:00,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 286 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:18:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 06:18:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-07 06:18:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.355263157894737) internal successors, (103), 77 states have internal predecessors, (103), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 06:18:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2024-11-07 06:18:00,167 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 179 [2024-11-07 06:18:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:00,167 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2024-11-07 06:18:00,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-11-07 06:18:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2024-11-07 06:18:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:18:00,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:00,171 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:00,192 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 06:18:00,372 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 06:18:00,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 256045711, now seen corresponding path program 1 times [2024-11-07 06:18:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:18:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753295617] [2024-11-07 06:18:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:18:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:18:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428471699] [2024-11-07 06:18:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:00,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:18:00,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:18:00,647 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 06:18:00,649 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 06:18:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:18:00,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:18:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:18:01,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:18:01,048 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:18:01,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:18:01,072 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 06:18:01,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:18:01,255 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 06:18:01,421 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:18:01,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:18:01 BoogieIcfgContainer [2024-11-07 06:18:01,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:18:01,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:18:01,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:18:01,428 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:18:01,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:17:56" (3/4) ... [2024-11-07 06:18:01,432 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:18:01,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:18:01,437 INFO L158 Benchmark]: Toolchain (without parser) took 6561.86ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.3MB in the beginning and 106.8MB in the end (delta: -14.5MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-11-07 06:18:01,437 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:18:01,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.30ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:18:01,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.67ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:18:01,438 INFO L158 Benchmark]: Boogie Preprocessor took 77.39ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:18:01,438 INFO L158 Benchmark]: RCFGBuilder took 687.75ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 49.4MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:18:01,439 INFO L158 Benchmark]: TraceAbstraction took 5299.75ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 48.9MB in the beginning and 106.8MB in the end (delta: -57.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2024-11-07 06:18:01,439 INFO L158 Benchmark]: Witness Printer took 5.51ms. Allocated memory is still 159.4MB. Free memory was 106.8MB in the beginning and 106.8MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:18:01,441 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.30ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.6MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.67ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.39ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 687.75ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 49.4MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5299.75ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 48.9MB in the beginning and 106.8MB in the end (delta: -57.9MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 5.51ms. Allocated memory is still 159.4MB. Free memory was 106.8MB in the beginning and 106.8MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] signed short int var_1_31 = 10; [L46] float var_1_39 = 4.7; [L47] unsigned short int var_1_40 = 100; [L48] signed short int var_1_41 = 4; [L49] float var_1_45 = 31.6; [L50] unsigned short int var_1_47 = 64; [L51] double var_1_48 = 16.75; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_7 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L146] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L146] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L147] var_1_10 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L148] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L149] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L149] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L150] var_1_12 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L151] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L152] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L152] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L153] var_1_13 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L154] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L155] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L155] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L156] var_1_14 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L157] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L158] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L158] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L161] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L161] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L164] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L164] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L166] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L168] var_1_19 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L169] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L170] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L170] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L171] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L171] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L173] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L174] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L176] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L178] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L179] var_1_26 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L180] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L56] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L57] COND TRUE var_1_10 <= var_1_17 [L58] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND FALSE !(var_1_25 < var_1_25) [L68] var_1_39 = 15.6f VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L70] var_1_47 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L71] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L72] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L74] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L79] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L80] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L84] var_1_40 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L85] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L86] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L87] COND FALSE !(10000000 <= var_1_16) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] COND TRUE var_1_7 || var_1_6 [L103] var_1_45 = (10.125f + var_1_24) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] COND FALSE !(\read(var_1_18)) [L108] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] COND TRUE var_1_1 && var_1_7 [L111] var_1_31 = ((((((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) < 0 ) ? -(((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] COND TRUE \read(var_1_1) [L122] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L134] var_1_29 = var_1_24 [L135] var_1_48 = var_1_25 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 350 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 1477 SizeOfPredicates, 3 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 7524/7560 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 06:18:01,487 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_fillercode_fillercodestructure_filler-pr-ci_file-29.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 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:18:03,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:18:03,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:18:03,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:18:03,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:18:04,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:18:04,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:18:04,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:18:04,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:18:04,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:18:04,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:18:04,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:18:04,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:18:04,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:18:04,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:18:04,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:18:04,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:18:04,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:18:04,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:18:04,025 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 -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2024-11-07 06:18:04,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:18:04,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:18:04,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:18:04,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:18:04,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:18:04,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:18:05,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:18:06,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:18:06,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:18:06,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f5ae660/f89958034a54401d8011d5b5da4b8a06/FLAG476fd7db4 [2024-11-07 06:18:06,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f5ae660/f89958034a54401d8011d5b5da4b8a06 [2024-11-07 06:18:06,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:18:06,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:18:06,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:18:06,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:18:06,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:18:06,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41106b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06, skipping insertion in model container [2024-11-07 06:18:06,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:18:06,353 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_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-11-07 06:18:06,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:18:06,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:18:06,474 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_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-11-07 06:18:06,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:18:06,530 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:18:06,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06 WrapperNode [2024-11-07 06:18:06,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:18:06,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:18:06,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:18:06,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:18:06,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,593 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-07 06:18:06,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:18:06,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:18:06,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:18:06,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:18:06,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,649 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 06:18:06,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:18:06,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:18:06,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:18:06,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:18:06,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (1/1) ... [2024-11-07 06:18:06,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:18:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:18:06,741 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 06:18:06,745 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 06:18:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:18:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:18:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:18:06,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:18:06,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:18:06,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:18:06,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:18:06,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:18:10,030 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 06:18:10,031 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:18:10,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:18:10,039 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:18:10,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:10 BoogieIcfgContainer [2024-11-07 06:18:10,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:18:10,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:18:10,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:18:10,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:18:10,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:18:06" (1/3) ... [2024-11-07 06:18:10,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cd86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:10, skipping insertion in model container [2024-11-07 06:18:10,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:18:06" (2/3) ... [2024-11-07 06:18:10,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cd86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:18:10, skipping insertion in model container [2024-11-07 06:18:10,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:18:10" (3/3) ... [2024-11-07 06:18:10,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-11-07 06:18:10,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:18:10,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:18:10,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:18:10,125 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;@33292f23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:18:10,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:18:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:18:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 06:18:10,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:10,144 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:10,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -833640326, now seen corresponding path program 1 times [2024-11-07 06:18:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043391464] [2024-11-07 06:18:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:10,160 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 06:18:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:10,162 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 06:18:10,164 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 06:18:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:10,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:18:10,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-07 06:18:10,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:18:10,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043391464] [2024-11-07 06:18:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043391464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:18:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:18:10,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340596552] [2024-11-07 06:18:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:18:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:18:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:18:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:18:10,750 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:18:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:10,789 INFO L93 Difference]: Finished difference Result 164 states and 294 transitions. [2024-11-07 06:18:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:18:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-07 06:18:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:10,799 INFO L225 Difference]: With dead ends: 164 [2024-11-07 06:18:10,800 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 06:18:10,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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 06:18:10,806 INFO L432 NwaCegarLoop]: 126 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, 126 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 06:18:10,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:18:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 06:18:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 06:18:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:18:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-07 06:18:10,857 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 178 [2024-11-07 06:18:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:10,858 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-07 06:18:10,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 06:18:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-07 06:18:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 06:18:10,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:10,862 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:10,881 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 06:18:11,062 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 06:18:11,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1543383626, now seen corresponding path program 1 times [2024-11-07 06:18:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621677335] [2024-11-07 06:18:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:11,066 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 06:18:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:11,070 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 06:18:11,071 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 06:18:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:11,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:18:11,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:18:11,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:11,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621677335] [2024-11-07 06:18:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621677335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:18:11,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [462974312] [2024-11-07 06:18:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:18:11,819 INFO L229 MonitoredProcess]: Starting monitored process 4 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 06:18:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 06:18:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:12,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:18:12,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:18:12,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:18:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [462974312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:12,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:18:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-07 06:18:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926475124] [2024-11-07 06:18:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:18:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:18:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:18:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:12,396 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:14,436 INFO L93 Difference]: Finished difference Result 183 states and 282 transitions. [2024-11-07 06:18:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:18:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-11-07 06:18:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:14,440 INFO L225 Difference]: With dead ends: 183 [2024-11-07 06:18:14,440 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 06:18:14,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:14,441 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:18:14,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 231 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 06:18:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 06:18:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-07 06:18:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 70 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 06:18:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-07 06:18:14,459 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 178 [2024-11-07 06:18:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:14,462 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-07 06:18:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-07 06:18:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 06:18:14,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:14,467 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:14,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:18:14,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-07 06:18:14,868 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:14,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:14,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1495240268, now seen corresponding path program 1 times [2024-11-07 06:18:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137924426] [2024-11-07 06:18:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:14,870 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 06:18:14,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:14,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:18:14,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:18:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:15,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:18:15,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:18:15,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:15,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137924426] [2024-11-07 06:18:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137924426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:18:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1158762726] [2024-11-07 06:18:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:15,523 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:15,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:18:15,526 INFO L229 MonitoredProcess]: Starting monitored process 6 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 06:18:15,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 06:18:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:16,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:18:16,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:18:16,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:18:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1158762726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:18:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 06:18:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621415068] [2024-11-07 06:18:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:18:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:18:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:18:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:16,622 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:17,437 INFO L93 Difference]: Finished difference Result 300 states and 459 transitions. [2024-11-07 06:18:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:18:17,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-07 06:18:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:17,477 INFO L225 Difference]: With dead ends: 300 [2024-11-07 06:18:17,477 INFO L226 Difference]: Without dead ends: 201 [2024-11-07 06:18:17,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:17,479 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 34 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:18:17,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:18:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-07 06:18:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-07 06:18:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.373134328358209) internal successors, (184), 136 states have internal predecessors, (184), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:18:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 304 transitions. [2024-11-07 06:18:17,517 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 304 transitions. Word has length 179 [2024-11-07 06:18:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:17,518 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 304 transitions. [2024-11-07 06:18:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 304 transitions. [2024-11-07 06:18:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 06:18:17,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:17,522 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:17,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 06:18:17,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:18:17,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:18:17,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:17,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1990380402, now seen corresponding path program 1 times [2024-11-07 06:18:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:17,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533291576] [2024-11-07 06:18:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:17,925 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 06:18:17,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:17,927 INFO L229 MonitoredProcess]: Starting monitored process 7 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 06:18:17,929 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 (7)] Waiting until timeout for monitored process [2024-11-07 06:18:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:18,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:18:18,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:18:18,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:18,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533291576] [2024-11-07 06:18:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533291576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:18:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1915791382] [2024-11-07 06:18:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:18:18,536 INFO L229 MonitoredProcess]: Starting monitored process 8 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 06:18:18,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 06:18:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:19,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:18:19,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 06:18:19,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:18:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1915791382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:18:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 06:18:19,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-07 06:18:19,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086291088] [2024-11-07 06:18:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:18:19,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:18:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:18:19,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:18:19,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:19,718 INFO L87 Difference]: Start difference. First operand 199 states and 304 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:22,397 INFO L93 Difference]: Finished difference Result 589 states and 902 transitions. [2024-11-07 06:18:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:18:22,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-07 06:18:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:22,402 INFO L225 Difference]: With dead ends: 589 [2024-11-07 06:18:22,402 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 06:18:22,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:18:22,407 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:18:22,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 322 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 06:18:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 06:18:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2024-11-07 06:18:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 262 states have (on average 1.3435114503816794) internal successors, (352), 266 states have internal predecessors, (352), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-07 06:18:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 592 transitions. [2024-11-07 06:18:22,503 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 592 transitions. Word has length 179 [2024-11-07 06:18:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:22,504 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 592 transitions. [2024-11-07 06:18:22,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 06:18:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2024-11-07 06:18:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 06:18:22,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:22,507 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:22,527 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 (7)] Ended with exit code 0 [2024-11-07 06:18:22,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 06:18:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:22,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 979263152, now seen corresponding path program 1 times [2024-11-07 06:18:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726071574] [2024-11-07 06:18:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:22,910 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 06:18:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:22,914 INFO L229 MonitoredProcess]: Starting monitored process 9 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 06:18:22,915 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 (9)] Waiting until timeout for monitored process [2024-11-07 06:18:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:23,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:18:23,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-07 06:18:23,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:23,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:18:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726071574] [2024-11-07 06:18:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726071574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:18:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1814712286] [2024-11-07 06:18:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 06:18:23,567 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:18:23,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 06:18:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:24,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:18:24,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:18:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-07 06:18:25,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:18:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 06:18:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1814712286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:18:26,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:18:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-07 06:18:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985187841] [2024-11-07 06:18:26,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:18:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 06:18:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:18:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 06:18:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:18:26,212 INFO L87 Difference]: Start difference. First operand 391 states and 592 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-07 06:18:35,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:18:38,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:18:40,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-07 06:18:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:18:45,471 INFO L93 Difference]: Finished difference Result 1057 states and 1555 transitions. [2024-11-07 06:18:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 06:18:45,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 179 [2024-11-07 06:18:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:18:45,483 INFO L225 Difference]: With dead ends: 1057 [2024-11-07 06:18:45,483 INFO L226 Difference]: Without dead ends: 669 [2024-11-07 06:18:45,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 06:18:45,487 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 411 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:18:45,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 482 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-07 06:18:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-07 06:18:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 431. [2024-11-07 06:18:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 294 states have (on average 1.2993197278911566) internal successors, (382), 298 states have internal predecessors, (382), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-07 06:18:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 622 transitions. [2024-11-07 06:18:45,561 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 622 transitions. Word has length 179 [2024-11-07 06:18:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:18:45,562 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 622 transitions. [2024-11-07 06:18:45,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-07 06:18:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 622 transitions. [2024-11-07 06:18:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-07 06:18:45,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:18:45,565 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:45,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 06:18:45,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-07 06:18:45,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 06:18:45,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:18:45,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:18:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -905718183, now seen corresponding path program 1 times [2024-11-07 06:18:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:18:45,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181402278] [2024-11-07 06:18:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:18:45,967 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 06:18:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:18:45,970 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:18:45,971 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 (11)] Waiting until timeout for monitored process [2024-11-07 06:18:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:18:46,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 06:18:46,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:19:02,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-07 06:19:11,549 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true